Iterative and hierarchical processing of request partitions

ABSTRACT

Methods and systems disclosed herein relate generally to temporally prioritizing queries of queue-task partitions based on distributions of flags assigned to bits corresponding to access rights.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/155,825, filed May 16, 2016, which claims the benefit of and priorityto U.S. Provisional Application No. 62/336,938, filed on May 16, 2016,the disclosures of each of which are hereby incorporated by reference inits entirety for all purposes.

FIELD

Methods and systems disclosed herein relate generally to temporallyprioritizing queries of queue-task partitions based on distributions offlags assigned to bits corresponding to access rights.

BACKGROUND

Data sets are becoming increasingly large and complex. Meanwhile,resources for querying and retrieving select data from data stores isoften limited. Thus, it may be desirable to identify a query plan suchthat a query is processed efficiently (e.g., as efficiently aspossible), so as to reduce or minimize a time to process the query andutilized resources. Queries may then be created more quickly.

SUMMARY

In some embodiments, a set of bits are defined. Each bit can include adata element and can be associated with one or more flags in accordancewith a schema. For example, in one instance, a value for a flag isappended (e.g., at a flag position) to a value of a bit. A bit may beassociated with an access right, and each flag associated with the bitmay correspond to a characteristic of the access right). An index can beestablished that identifies, for each flag, a quantity of bitsassociated with the flag. In one instance, the index identifies, foreach of a set of resources and for each of a set of flags, a quantity ofbits associated both with the resource and the flag.

A request for assignment of one or more access rights for a resource maybe received from a device. A queue task can be generated based on therequest. The queue task can include, for each of one, more or allconstraints associated with the request, a task factor that correspondsto the constraint. The queue task can be added to a queue associatedwith a resource.

For each queue task associated with multiple task factors, a set ofqueue-task partitions can be defined. Each queue-task partition cancorrespond to a task factor. Queue-task partitions of a given queue taskcan be prioritized relative to each other. Queries for queue-taskpartitions may then be performed in an order corresponding to theprioritization. Queue-task partitions can be prioritized based on theindex. For example, each queue-task partition may be associated with aflag. Queue-task partitions may then be prioritized based on bit countsassociated with the task-associated flags. For example, a queue-taskpartition associated with a flag identified at the index as beingassociated with a relatively low number of bits may be prioritized abovea queue-task partition associated with a flag identified at the index asbeing associated with a relatively high number of bits.

Queries for queue-task partitions may be performed iteratively and, insome instances, bi-directionally. For example, a query for a highlyprioritized queue-task partition may be performed to identify a firstresult. Subsequent queries for queue-task partitions can be performeduntil the first result does not correspond with the task factorsassociated with the partition. Thus, the subsequent queries maycorrespond to assessing one or more flags associated with each of one ormore bits represented in the first result to determine whether theflag(s) correspond to a task factor. At that point, a query for thehighly prioritized queue-task partition may be performed again so as toidentify a second result different from the first result. When a resultis identified that corresponds to each task factor of a queue task, datacorresponding to the result (e.g., identifying one or more parameters ofone or more bits for the result) can be transmitted to a deviceassociated with the request. Further or alternatively, a status of eachbit corresponding to the result (e.g., as represented by a flag) may bechanged (e.g., to inhibit or prevent assignment of the bit).

The terms and expressions which have been employed are used as terms ofdescription and not of limitation, and there is no intention in the useof such terms and expressions of excluding any equivalents of thefeatures shown and described or portions thereof, but it is recognizedthat various modifications are possible within the scope of theinvention claimed. Thus, it should be understood that although thepresent invention has been specifically disclosed by embodiments andoptional features, modification and variation of the concepts hereindisclosed may be resorted to by those skilled in the art, and that suchmodifications and variations are considered to be within the scope ofthis invention as defined by the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure is described in conjunction with the appendedfigures:

FIG. 1 depicts a block diagram of an embodiment of a resourceaccess-facilitating interaction system;

FIG. 2 shows an illustration of hardware and network connections of aresource access-facilitating interaction system according to anembodiment of the invention;

FIG. 3 shows an illustration of a communication exchange betweencomponents involved in a resource access-facilitating interaction systemaccording to an embodiment of the invention;

FIG. 4 illustrates example components of a device;

FIG. 5 illustrates example components of resource access coordinatormodule;

FIG. 6 illustrates a flowchart of an embodiment of a process forassigning access rights for resources;

FIGS. 7A and 7B show embodiments of site systems in relations to mobiledevices;

FIG. 8 shows a block diagram of user device according to an embodiment;

FIG. 9 illustrates sample components of an embodiment of site system180, including connections to a NAS and access management system;

FIGS. 10A and 10B illustrate examples of communication exchangesinvolving primary and secondary load management systems.;

FIG. 11 illustrates a flowchart of an embodiment of a process forprocessing multiple queue tasks based upon task factors and resourcestructures;

FIG. 12 illustrates a flowchart of an embodiment of a process foriteratively processing the set of queue-task partitions in accordancewith a query execution plan; and

FIG. 13 illustrates an example of generating and processing queue tasksvia queue-task partitioning.

In the appended figures, similar components and/or features can have thesame reference label. Further, various components of the same type canbe distinguished by following the reference label by a dash and a secondlabel that distinguishes among the similar components. If only the firstreference label is used in the specification, the description isapplicable to any one of the similar components having the same firstreference label irrespective of the second reference label.

DETAILED DESCRIPTION

The ensuing description provides preferred exemplary embodiment(s) onlyand is not intended to limit the scope, applicability or configurationof the disclosure. Rather, the ensuing description of the preferredexemplary embodiment(s) will provide those skilled in the art with anenabling description for implementing a preferred exemplary embodiment.It is understood that various changes can be made in the function andarrangement of elements without departing from the spirit and scope asset forth in the appended claims.

FIG. 1 depicts a block diagram of an embodiment of a resource managementsystem 100, according to an embodiment of the present disclosure. Mobiledevice 110 (which can be operated by a user 105) and an event-providerdevice 120 (which can be operated, controlled, or used by an eventprovider 115) can communicate with an access management system 185directly or via another system (e.g., via an intermediate system 150).Mobile device 110 may transmit data to access point 145, which isconnected to network 155, over communication channel 140 using antennae135. While FIG. 1 illustrates mobile device 110 communicating withaccess point 145 using a wireless connection (e.g., communicationchannel 140), in some embodiments, mobile device 110 may alsocommunicate with access point 145 using a wired connection (e.g., anEthernet connection). Mobile device 110 can also communicate with one ormore client devices, such as a client agent device 170 operated by aclient agent 175, a client register 160 or a client point device 165using a wired or wireless connection. In addition, using the accessmanagement system 185, an event provider 115 can identify an event, aparameter of attending the event, a date or dates of the event, alocation or locations of the event, etc. Each inter-system communicationcan occur over one or more networks 155 and can facilitate transmissionof a variety of types of data. It will be understood that, although onlyone of various systems, devices, entities and network are shown, theresource management system 100 can be extended to include multiple ofany given system(s), device(s), entity(ies), and/or networks.

Access management system 185 can be configured to manage a dynamic setof access rights to one or more resources. More specifically, accessmanagement system 185 can track which resources are to be made availableto users, specifications of the resources and times at which they willbe available. Access management system 185 can also allocate accessrights for resources and facilitate transmissions of notifications ofthe available rights to a set of user devices. For example, accessmanagement system 185 can alert users of the availability via a website,app page or email. As another example, access management system cantransmit data about access rights and resources to one or moreintermediate systems 150, which can facilitate distribution ofaccess-right availability and processing of requests for such rights.

Notifications of available access rights can be accompanied by optionsto request that one or more access rights be assigned to a user.Therefore, user 105 can provide input to mobile device 110 via aninterface to request such assignment and provide other pertinentinformation. Intermediate system 150 and/or access management system 185can process the request to ensure that the requested access right(s)remain available and that all required information has been receivedand, in some instances, verified. Thereafter, access management system185 can assign one or more access rights to the user, e.g., matching theaccess rights requested by the user.

Assigning an access right can include, for example, associating anidentifier of the right with an identifier of a user, changing a statusof the right from available to assigned, facilitating a cease innotifications that the access right is available, generating anaccess-enabling code to use such that the corresponding access will bepermitted and/or generating a notification to be received at mobiledevice 110 confirming the assignment and/or including data required forcorresponding access to be permitted.

In some instances, a resource is at least partly controlled, by aclient. The resource may be accessed at a particular location orstructure, and a variety of client devices may be present at thelocation so as to facilitate usage of an access right. Exemplary clientdevices can include client agent device 170, which can be one operatedby a client agent 175 (e.g., a human client agent), a client register160 (e.g., which can operate independently of an agent and/or can beconnected to or include a device that, while in a locked mode, canimpede resource access, such as a turnstile) and client point device 165(e.g., which can operate independently of an agent and/or can bepositioned at or around the resource-associated location. For example,in some instances client agent device 170 can be operated by an agent ata location for a resource that is an event (“event resource”) takingplace at the location. In this example, client agent device 170 is usedby an agent that is manning an entrance to the location (e.g., which caninclude, for example, a location of a structure or a geographic region)or a part thereof; client register 160 can be or can be connected to aturnstile, gate or lockable door that is positioned along a perimeter orentrance to a resource-associated location or part thereof; and clientpoint device 165 can be an electronic device positioned at or within aresource-associated location.

In some instances, mobile device 110 performs particular functions upondetecting a client device and/or the contrary. For example, mobiledevice 110 may locally retrieve or request (e.g., from an externalsource) an access-enabling code. The access-enabling code can betransmitted to the client device or a remote server (e.g., a serverhosting access management system 185) for evaluation and/or can belocally evaluated. The evaluation can include, for example, confirmingthat the access-enabling code has a particular characteristic or format(e.g., generally or one characteristic corresponding to a particularresource or type of access), matches one in an access-enabling code datastore and/or has not been previously redeemed. A result of theevaluation can be locally displayed at an evaluating device, can controla device component (e.g., a physical access control module), and/or canbe transmitted to another device, such as mobile device 110.

In some instances, user 105 can use multiple mobile devices 110 toperform various operations (e.g., using one device to request an accessright and another to interact with client devices). Some instances ofmobile device 110, access management system 185, intermediate system150, client agent device 170, client register 160 and/or client pointdevice 165 can include a portable electronic device (e.g., a smartphone, tablet, laptop computer or smart wearable device) or anon-portable electronic device (e.g., one or more desktop computers,servers and/or processors).

In exemplary embodiments, access rights can be represented in datamaintained at a client device or at access management system 185. Forexample, a database or data store include a list of identifiers for eachuser or user device having an assigned access right for a resource orassociating an identifier for each user or user device with anidentifier of a particular access right. In some instances, indicia canbe transmitted to a user device that indicates that an access right isavailed. In various instances, it may be permitted or prohibited for theindicia to be transferred. The indicia may be provided as part of anelectronic or physical object (e.g., a right to access an event) orindependently. The indicia may include an access-enabling code.

In some instances, access management system 185 communicates with one ormore intermediate systems 150, each of which may be controlled by adifferent entity as compared to an entity controlling access managementsystem 185. For example, access management system 185 may assign accessrights to intermediate systems 150 (e.g., upon acceptance of terms).Intermediate system 150 can then collect data pertaining to the assignedaccess rights and/or a corresponding event, can format and/or edit thedata, generate a notification of availability of the access rights thatincludes the formatted and/or edited data and facilitate presentation ofthe notification at a mobile device 110. When intermediate system 150receives a communication from the mobile device 110 indicative of anaccess-right request, intermediate system 150 can facilitate assignment(or reassignment) of an access right to the user (e.g., by transmittingrelevant information to access management system 185 identifying theuser and/or user device and/or by transmitting relevant information tomobile device 110 pertaining to the access right).

A resource can include one managed or provided by a client, such as aperforming entity or an entity operating a venue. A mobile device 110can transmit data corresponding to the access right (e.g., anaccess-enabling code) to a client device upon, for example, detectingthe client device, detecting that a location of the mobile device 110 iswithin a prescribed geographical region, or detecting particular input.The receiving client device may include, for example, a client agentdevice 170 operated at an entrance of a defined geographical location ora client register 160 that includes or is attached to a lockingturnstile. The client device can then analyze the code to confirm itsvalidity and applicability for a particular resource and/or access type,and admittance to the event can be accordingly permitted. For example, aturnstile may change from a locked to an unlocked mode upon confirmationof the code's validity and applicability.

Each of the depicted devices and/or systems may include a software agentor application (“app”) that, when executed, performs one or more actionsas described herein. In some instances, a software agent or app on onedevice is, at least in part, complementary to a software agent or app onanother device (e.g., such that a software agent or app on mobile device110 is, at least in part, complementary to at least part of one onaccess management system 185 and/or a client device; and/or such that asoftware agent or app on intermediate system 150 is, at least in part,complementary to at least part of one on access management system 185).

In some instances, a network in the one or more networks 155 can includean open network, such as the Internet, personal area network, local areanetwork (LAN), campus area network (CAN), metropolitan area network(MAN), wide area network (WAN), wireless local area network (WLAN), aprivate network, such as an intranet, extranet, or other backbone. Insome instances, a network in the one or more networks 155 includes ashort-range communication channel, such as Bluetooth or Bluetooth LowEnergy channel. Communicating using a short-range communication such asBLE channel can provide advantages such as consuming less power, beingable to communicate across moderate distances, being able to detectlevels of proximity, achieving high-level security based on encryptionand short ranges, and not requiring pairing for inter-devicecommunications.

In one embodiment, communications between two or more systems and/ordevices can be achieved by a secure communications protocol, such assecure sockets layer (SSL), transport layer security (TLS). In addition,data and/or transactional details may be encrypted based on anyconvenient, known, or to be developed manner, such as, but not limitedto, DES, Triple DES, RSA, Blowfish, Advanced Encryption Standard (AES),CAST-128, CAST-256, Decorrelated Fast Cipher (DFC), Tiny EncryptionAlgorithm (TEA), eXtended TEA (XTEA), Corrected Block TEA (XXTEA),and/or RCS, etc.

It will be appreciated that, while a variety of devices and systems areshown in FIG. 1, in some instances, resource management system 100 caninclude fewer devices and/or systems. Further, some systems and/ordevices can be combined. For example, a client agent device 170 may alsoserve as an access management system 185 or intermediate system 150 soas to as to facilitate assignment of access rights.

As described in further detail herein, an interaction between mobiledevice 110 and a client device (e.g., client agent device 170, clientregister 160 or client point device 165) can facilitate, for example,verification that user 105 has a valid and applicable access right,obtaining an assignment of an access right, and/or obtaining anassignment of an upgraded access right.

In addition, mobile device 110-2, which is operated by user 125-2, mayinclude a user device that is located at a stadium or concert hallduring an event. Mobile device 110-2 may directly interact with a clientdevice (e.g., client agent device 170, client register 160 or clientpoint device 165), which is also located at the stadium or concert hallduring the event. As such, the access management system 185 may beupdated or accessed by mobile device 110-2 via the client agent device170. For example, mobile device 110-2 may communicate with the clientagent device 170 over a short-range communication channel 190, such asBluetooth or Bluetooth Low Energy channel, Near Field Communication(NFC), Wi-Fi, RFID, Zigbee, ANT, etc. Communicating using a short-rangecommunication such as BLE channel can provide advantages such asconsuming less power, being able to communicate across moderatedistances, being able to detect levels of proximity, achievinghigh-level security based on encryption and short ranges, and notrequiring pairing for inter-device communications. After the short-rangecommunication link 190 is established, mobile device 110-2 maycommunicate with the access management system 185 and access the item oritems of resources. That is, while mobile device B is configured tocommunicate over network 155, mobile device 110-2 may communicate withthe access management system 185 via the client agent device 170,instead of the network 155.

It will be appreciated that various parts of system 100 can begeographically separated. It will further be appreciated that system 100can include a different number of various components rather than anumber depicted in FIG. 1. For example, two or more of access assignmentsystems 185; one or more site systems 180; and intermediate system 150may be located in different geographic locations (e.g., differentcities, states or countries).

FIG. 2 shows an illustration of hardware and network connections of aresource access-facilitating interaction system 200 according to anembodiment of the invention. Each of various user devices 210-1, 210-2,210-3, 210-4 and 210-5 can connect, via one or more inter-networkconnection components (e.g., a router 212) and one or more networks 270to a primary assignment management system 214 or a secondary assignmentmanagement system 216-1, 216-2 or 216-3.

Primary assignment management system 214 can be configured to coordinateand/or control initial assignment of access rights. Secondary assignmentmanagement system 216 can be configured to coordinate and/or controlreassignment and/or transfer of access rights (e.g., from one user oruser device to another or from an intermediate agent to a user or userdevice). Such transfer may occur as a result of a sale or fee payment.Secondary assignment management system 216 may also manage transferoffers (e.g., to allow a first user to identify a price at which atransfer request would be granted and to detect if a valid request isreceived). It will be appreciated that, although primary assignmentmanagement system 214 is shown to be separate from each secondaryassignment management system 216, in some instances, an assignmentmanagement system may relate to both a primary and secondary channel,and a single data store or a localized cluster of data stores mayinclude data from both channels.

Each of primary access assignment system 214 and secondary accessassignment system 216 can include a web server 218 that processes andresponds to HTTP requests. Web server 218 can retrieve and deliverweb-page data to a user device 210 that, for example, identify aresource, identify a characteristic of each of one or more access rightsfor the resource, include an invitation to request assignment of anaccess right, facilitate establishment or updating of an account, and/oridentify characteristics of one or more assigned access rights. Webserver 218 can be configured to support server-side scripting and/orreceive data from user devices 210, such as data from forms or fileuploads.

In some instances, a web server 218 can be configured to communicatedata about a resource and an indication that access rights for theresource are available. Web server 218 can receive a requestcommunication from a user device 210 that corresponds to a request forinformation about access rights. The request can include one or moreconstraints, which can correspond to (for example) values (e.g., to bematched or to define a range) of particular fields.

A management server 222 can interact with web server 218 to provideindications as to which access rights' are available for assignment,characteristics of access rights and/or what data is needed to assign anaccess right. When requisite information is received (e.g., about a userand/or user device, identifying a final request for one or more accessrights, including payment information, and so on), management server 222can coordinate an assignment of the one or more access rights. Thecoordination can include updating an access-right data store to change astatus of the one or more access rights (e.g., to assigned); toassociate each of the one or more access rights with a user and/or userdevice; to generate or identify one or more access-enabling codes forthe one or more access rights; and/or to facilitate transmissionreflecting the assignment (e.g., and including the one or moreaccess-enabling codes) to a user device.

Management server 222 can query, update and manage an access-right datastore to identify access rights' availability and/or characteristicand/or to reflect a new assignment. The data store can include oneassociated with the particular assignment system. In some instances, thedata store includes incomplete data about access rights for a resource.For example, a data store 224 at and/or used by a secondary accessassignment system 216 may include data about an incomplete subset ofaccess rights that have been allocated for a particular resource. Toillustrate, a client agent may have indicated that an independentintermediary system can (exclusively or non-exclusively) coordinateassignment of a portion of access rights for a resource but not theremainder. A data store 224 may then, for example, selectively includeinformation (e.g., characteristics, statuses and/or assignmentassociations) for access rights in the portion.

Data store 224 or 226 associated with a particular primary or secondaryaccess assignment system can include assignment data for a set of accessrights that are configured to be set by the particular primary orsecondary access assignment system or by another system. For example, arule can indicate that a given access right is to have an availablestatus until a first of a plurality of access assignment systems assignsthe access right. Accordingly, access assignment systems would then needto communicate to alert each other of assignments.

In one instance, management server 222 (or another server in an accessassignment system) sends a communication to a central data managementserver farm 228 reflecting one or more recent assignments. Thecommunication may include an identification of one or more accessrights, an indication that the access right(s) have been assigned, anidentification of a user and/or user device associated with theassignment and/or one or more access-enabling codes generated oridentified to be associated with the assignment. The communication canbe sent, for example, upon assigning the access right(s), as a precursorto assigning the access right(s) (e.g., to confirm availability and/orrequest assignment authorization), at defined times or time intervalsand/or in response to an assignment-update request received from datamanagement server farm 228.

Data management server farm 228 can then update a central data store toreflect the data from the communication. The central data store can bepart of, for example, a network-attached storage 232 and/or astorage-area network 234.

In some instances, a data store 224 or 226 can include a cache, thatincludes data stored based on previous communications with datamanagement server farm 228. For example, data management server farm 228may periodically transmit statuses of a set of access rights (e.g.,those initially configured to be assignable by an access assignmentsystem) or an updated status (e.g., indicating an assignment) of one ormore access rights. As another example, data management server farm 228may transmit statuses upon receiving a request from an access assignmentsystem for statuses and/or authorization to assign one or more accessrights.

An access assignment system may receive statuses less frequently or attimes unaligned with requests received from user devices requestinginformation about access rights and/or assignments. Rather than initiatea central data store query responsive to each user-device request, amanagement server 222 can rely on cached data (e.g., locally cacheddata) to identify availability of one or more access rights, as reflectin webpage data and/or communications responsive to requestcommunications for access-right information. After requisite informationhas been obtained, management server 222 can then communicate with datamanagement server farm 228 to ensure that one or more particular accessrights have remained available for assignment.

In some instances, one or more of primary access assignment system 214and/or a secondary access assignment system 214 need not include a localor system-inclusive data store for tracking access-right statuses,assignments and/or characteristics. Instead, the access assignmentsystem may communicate with a remote and/or central data store (e.g.,network-attached storage 232 or storage-area network 234).

Access management system 120 can include a primary access assignmentsystem 214 and/or a secondary access assignment system 214; datamanagement server farm 228; and/or a central data store (e.g.,network-attached storage 232 or storage-area network 234). Each of oneor more intermediate systems 130 can include a primary access assignmentsystem 214 and/or a secondary access assignment system 214.

Data management server farm 228 may periodically and/or routinely assessa connection with an access assignment system 214. For example, a testcommunication can be sent that is indicative of a request to respond(e.g., with particular data or generally). If a response communicationis not received, if a response communication is not received within adefined time period and/or if a response communication includesparticular data (e.g., reflecting poor data integrity, network speed,processing speed, etc.), data management server farm 228 may reconfigureaccess rights and/or permissions and/or may transmit anothercommunication indicating that assignment rights of the access assignmentsystem are limited (e.g., to prevent the system from assigning accessrights).

It will be appreciated that various parts of system 200 can begeographically separated.

For example, two or more of primary access assignment system 214; one ormore of secondary access assignment systems 214; and data managementserver farm 228 may be located in different geographic locations (e.g.,different cities, states or countries).

It will further be appreciated that system 200 can include a differentnumber of various components rather than a number depicted in FIG. 2.For example, system 200 can include multiple data management serverfarms 228, central data stores and/or primary access assignment systems214 (e.g., which can be geographically separated, such as being locatedin different cities, states or countries). In some instances, processingmay be split (e.g., according to a load-balancing technique) acrossmultiple data management server farms 228 and/or across multiple accessassignment systems 214. Meanwhile, the farms and/or systems can beconfigured to accept an increased or full load should another farmand/or system be unavailable (e.g., due to maintenance). Data stored ina central data store may also be replicated in geographically separateddata stores.

FIG. 3 shows an illustration of a communication exchange betweencomponents involved in a resource access-facilitating interaction system300 according to an embodiment of the invention. A user device 310 cansend one or more HTTP requests to a web-server system 318, andweb-server system 318 can respond with one or more HTTP responses thatinclude webpage data. The webpage data can include, for example,information about one or more resources, characteristics of a set ofaccess rights for each of the one or more resources, availability of oneor more access rights, an invitation to request an assignment of one ormore access rights and/or indications as to what information is requiredfor an access-right assignment. HTTP requests can includeassignment-request data (e.g., a resource identification, requisiteinformation, and/or an identification of an access-right constraint oraccess right).

Web-server system 318 can include one or more web processors (e.g.,included in one or more server farms, which may be geographicallyseparated) to, for example, map a path component of a URL to web data(e.g., stored in a local file system or generated by a program);retrieve the web data; and/or generate a response communicationincluding the web data. Web processor can further parse communication toidentify input-corresponding data in HTTP requests, such as field valuesrequired for an access-right assignment.

Web-server system 318 can also include a load balancer to distributeprocessing tasks across multiple web processors. For example, HTTPrequests can be distributed to different web processors. Load-balancingtechniques can be configured so as, for example, to distributeprocessing across servers or server farms, decrease a number of hopsbetween a web server and user device, decrease a geographical locationbetween a user device and web server, etc.

Web-server system 318 can further include a RAID component, such as aRAID controller or card. A RAID component can be configured, forexample, to stripe data across multiple drives, distribute parity acrossdrives and/or mirror data across multiple drives. The RAID component canbe configured to improve reliability and increase request-processingspeeds.

Web-server system 318 can include one or more distributed,non-distributed, virtual, non-virtual, local and/or remote data stores.The data stores can include web data, scripts and/or content object(e.g., to be presented as part or web data).

Some HTTP requests include requests for identifications of access-rightcharacteristics and/or availability. To provide web data reflecting suchinformation, web-server system 318 can request the information fromanother server, such as an SQL system 341 (e.g., which may include oneor more servers or one or more server farms).

SQL system 341 can include one or more SQL processors (e.g., included inone or more server farms, which may be geographically separated). SQLprocessors can be configured to query, update and otherwise use one ormore relational data stores. SQL processors can be configured to execute(and, in some instances, generate) code (e.g., SQL code) to query arelational data store.

SQL system 341 can include a database engine, that includes a relationalengine, OLE database and storage engine. A relational engine canprocess, parse, compile, and/or optimize a query and/or makequery-associated calls. The relational engine can identify an OLE DB rowset that identifies the row with columns matching search criteria and/ora ranking value. A storage engine can manage data access and use therowset (e.g., to access tables and indices) to retrieve query-responsivedata from one or more relational databases.

SQL system 341 can include one or more distributed, non-distributed,virtual, non-virtual, local and/or remote relational data stores. Therelational databases can include linked data structures identifying, forexample, resource information, access-right identifications andcharacteristics, access-right statuses and/or assignments, and/or userand/or user account data. Thus, for example, use of the relationalstructures may facilitate identifying, for a particular user, acharacteristic of an assigned access right and information about aresource associated with the access right.

One or more data structures in a relational data structure may reflectwhether particular access rights have been assigned or remain available.This data may be based on data received from a catalog system 342 thatmonitors and tracks statuses of resource access rights. Catalog system342 can include one or more catalog processors (e.g., included in one ormore server farms, which may be geographically separated). Catalogprocessors can be configured to generate status-update requestcommunications to be sent to one or more access assignment systemsand/or intermediate systems and/or to receive status-updatecommunications from one or more access assignment systems and/orintermediate systems. A status-update communication can, for example,identify an access right and/or resource and indicate an assignment ofthe access right. For example, a status-update communication canindicate that a particular access right has been assigned and is thus nolonger available. In some instances, a status-update communicationidentifies assignment details, such as a user, account and/or userdevice associated with an access-right assignment; a time that theassignment was made; and/or a price associated with the assignment.

In some instances, a status update is less explicit. For example, acommunication may identify an access right and/or resource and request afinal authorization of an assignment of the access right. Catalog system342 can then verify that the access right is available for assignment(e.g., and that a request-associated system or entity is authorized tocoordinate the assignment) and can transmit an affirmative response.Such a communication exchange can indicate (in some instances) that theaccess right is assigned and unavailable for other assignment.

In some instances, catalog system 342 can also be integrated with anon-intermediate access assignment system, such that it can directlydetect assignments. For example, an integrated access assignment systemcan coordinate a message exchange with a user device, can query acatalog data store to identify available access rights and canfacilitate or trigger a status-change of an access right to reflect anassignment (e.g., upon having received all required information.

Whether a result of a direct assignment detection or a status updatefrom an intermediate system, a database engine of catalog system 342 canmanage one or more data stores so as to indicate a current status ofeach of a set of access rights for a resource. The one or more datastores may further identify any assignment constraints. For example,particular access rights may be earmarked so as to only allow one ormore particular intermediate systems to trigger a change to the accessrights' status and/or to assign the access rights.

The database engine can include a digital asset management (DAM) engineto receive, transform (e.g., annotate, reformat, introduce a schema,etc.) status-update communications, and identify other data (e.g., anidentifier of an assigning system and/or a time at which a communicationwas received) to associate with a status update (e.g., an assignment).Therefore, the DAM engine can be configured to prepare storage-updatetasks so as to cause a maintained data store to reflect a recent datachange.

Further, the DAM engine can facilitate handling of data-store queries.For example, a status-request communication or authorization-requestcommunication can be processed to identify variables and/or indices touse to query a data store. A query can then be generated and/or directedto a data store based on the processing. The DAM engine can relay (e.g.,and, potentially, perform intermediate processing to) a query result toa request-associate system.

The database engine can also include a conflict engine, which can beconfigured to access and implement rules indicating how conflicts are tobe handled. For example, catalog system 342 may receive multiplerequests within a time period requesting an assignment authorization (ora hold) for a particular access right. A rule may indicate that a firstrequest is to receive priority, that a request associated with a morehighly prioritized requesting system (e.g., intermediate system) is tobe prioritized, that a request associated with a relatively high (orlow) quantity of access rights identified in the request for potentialassignment are to be prioritized, etc.

The database engine can further include a storage engine configured tomanage data access and/or data updates (e.g., modifying existing data oradding new data). The data managed by and/or accessible to the storageengine can be included in one or more data stores. The data stores caninclude, for example, distributed, non-distributed, virtual,non-virtual, local and/or remote data stores. The data stores caninclude, for example, a relational, non-relational, object, non-object,document and/or non-document data store. Part or all of a data store caninclude a shadow data store, that shadows data from another data store.Part or all of a data store can include an authoritative data store thatis (e.g., directly and/or immediately) updated with access-rightassignment changes (e.g., such that a primary or secondary accessassignment system updates the data store as part of an access-rightassignment process, rather than sending a post-hoc status-updatecommunication reflecting the assignment). In some instances, a datastore an authoritative data store identifies a status for each of a set(e.g., or all) of access rights for a given resource. Should there beany inconsistency between an authoritative data store and another datastore (e.g., at an intermediate system), system 300 can be configuredsuch that the authoritative data store is controlling.

System 300 can further include a replication system 343. Replicationsystem 343 can include one or more replication processors configured toidentify new or modified data, to identify one or more data storesand/or location at which to store the new or modified data and/or tocoordinate replication of the data. In some instances, one or more ofthese identifications and/or coordination can be performed using areplication rule. For example, a replication rule may indicate thatreplication is to be performed in a manner biased towards storingreplicated data at a data store geographically separated from anotherdata store storing the data.

A data duplicator can be configured to read stored data and generate oneor more write commands so as to store the data at a different datastore. A controller can manage transmitting write commands appropriatelyso as to facilitate storing replicated data at identified data stores.Further, a controller can manage data stores, such as a distributedmemory or distributed shared memory, to ensure that a currently activeset of data stores includes a target number of replications of data.

Accordingly, web-server system 318 can interact with user device 310 toidentify available access rights and to collect information needed toassign an access right. Web-server system 318 can interact with SQLsystem 341 so as to retrieve data about particular resources and/oraccess rights so as to configure web data (e.g., via dynamic webpages orscripts) to reflect accurate or semi-accurate information and/orstatuses. SQL system 341 can use relational data stores to quicklyprovide such data. Meanwhile, catalog system 342 may manage one or morenon-relational and/or more comprehensive data stores may be tasked withmore reliably and quickly tracking access-right statuses andassignments. The tracking may include receiving status updates (e.g.,via a push or pull protocol) from one or more intermediate systemsand/or by detecting assignment updates from non-intermediate systems,such as an integrated access assignment system and/or SQL system 341.Catalog system 342 may provide condensed status updates (e.g.,reflecting a binary indication as to whether an access right isavailable) to SQL system 341 periodically, at triggered times and/or inresponse to a request from the SQL system. A replication system 343 canfurther ensure that data is replicated at multiple data stores, so as toimprove a reliability and speed of system 300.

It will be appreciated that various parts of system 300 can begeographically separated. For example, each of user device 310,intermediate system 330, web-server system 318, SQL system 341, catalogsystem 342 and replication 343 may be located in different geographiclocations (e.g., different cities, states or countries).

FIG. 4 illustrates example components of a device 400, such as a clientdevice (e.g., client agent device 140, client register 150 and/or clientpoint device 160), an intermediate system (e.g., intermediate system130) and/or an access management system (e.g., access management system120) according to an embodiment of the invention.

The components can include one or more modules that can be installed ondevice 400. Modules can include some or all of the following: a networkinterface module 402 (which can operate in a link layer of a protocolstack), a message processor module 404 (which can operate in an IP layerof a protocol stack), a communications manager module 406 (which canoperate in a transport layer of a protocol stack), a communicationsconfigure module 408 (which can operate in a transport and/or IP layerin a protocol stack), a communications rules provider module 410 (whichcan operate in a transport and/or IP layer in a protocol stack),application modules 412 (which can operate in an application layer of aprotocol stack), a physical access control module 432 and one or moreenvironmental sensors 434.

Network interface module 402 receives and transmits messages via one ormore hardware components that provide a link-layer interconnect. Thehardware component(s) can include, for example, RF antenna 403 or a port(e.g., Ethernet port) and supporting circuitry. In some embodiments,network interface module 402 can be configured to support wirelesscommunication, e.g., using Wi Fi (IEEE 802.11 family standards),Bluetooth® (a family of standards promulgated by Bluetooth SIG, Inc.),BLE, or near-field communication (implementing the ISO/IEC 18092standards or the like).

RF antenna 403 can be configured to convert electric signals into radioand/or magnetic signals (e.g., to radio waves) to transmit to anotherdevice and/or to receive radio and/or magnetic signals and convert themto electric signals. RF antenna 403 can be tuned to operate within aparticular frequency band. In some instances, a device includes multipleantennas, and the antennas can be, for example, physically separated. Insome instances, antennas differ with respect to radiation patterns,polarizations, take-off angle gain and/or tuning bands. RF interfacemodule 402 can include one or more phase shifters, filters, attenuators,amplifiers, switches and/or other components to demodulate receivedsignals, coordinate signal transmission and/or facilitate high-qualitysignal transmission and receipt.

In some instances, network interface module 402 includes a virtualnetwork interface, so as to enable the device to utilize an intermediatedevice for signal transmission or reception. For example, networkinterface module 402 can include VPN software.

Network interface module 402 and one or more antennas 403 can beconfigured to transmit and receive signals over one or more connectiontypes. For example, network interface module 402 and one or moreantennas 403 can be configured to transmit and receive WiFi signals,cellular signals, Bluetooth signals, Bluetooth Low Energy (BLE) signals,Zigbee signals, or Near-Field Communication (NFC) signals.

Message processor module 404 can coordinate communication with otherelectronic devices or systems, such as one or more servers or a userdevice. In one instance, message processor module 404 is able tocommunicate using a plurality of protocols (e.g., any known, futureand/or convenient protocol such as, but not limited to, XML, SMS, MMS,and/or email, etc.). Message processor module 404 may further optionallyserialize incoming and/or outgoing messages and facilitate queuing ofincoming and outgoing message traffic.

Message processor module 404 can perform functions of an IP layer in anetwork protocol stack. For example, in some instances, messageprocessor module 404 can format data packets or segments, combine datapacket fragments, fragment data packets and/or identify destinationapplications and/or device addresses. For example, message processormodule 404 can defragment and analyze an incoming message to determinewhether it is to be forwarded to another device and, if so, can addressand fragment the message before sending it to the network interfacemodule 402 to be transmitted. As another example, message processormodule 404 can defragment and analyze an incoming message to identify adestination application that is to receive the message and can thendirect the message (e.g., via a transport layer) to the application.

Communications manager module 406 can implement transport-layerfunctions. For example, communications manager module 406 can identify atransport protocol for an outgoing message (e.g., transmission controlprotocol (TCP) or user diagram protocol (UDP)) and appropriatelyencapsulate the message into transport protocol data units. Messageprocessor module 404 can initiate establishment of connections betweendevices, monitor transmissions failures, control data transmission ratesand monitoring transmission quality. As another example, communicationsmanager module 406 can read a header of an incoming message to identifyan application layer protocol to receive the message's data. The datacan be separated from the header and sent to the appropriateapplication. Message processor module 404 can also monitor the qualityof incoming messages and/or detect out of order incoming packets.

In some instances, characteristics of message-receipt ormessage-transmission quality can be used to identify a health status ofan established communications link. In some instances, communicationsmanager module 406 can be configured to detect signals indicating thehealth status of an established communications link (e.g., a periodicsignal from the other device system, which if received without dropouts,indicates a healthy link).

In some instances, a communication configurer module 408 is provided totrack attributes of another system so as to facilitate establishment ofa communication session. In one embodiment, communication configurermodule 408 further ensures that inter-device communications areconducted in accordance with the identified communication attributesand/or rules. Communication configurer module 408 can maintain anupdated record of the communication attributes of one or more devices orsystems. In one embodiment, communications configurer module 408 ensuresthat communications manager module 406 can deliver the payload providedby message processor module 404 to the destination (e.g., by ensuringthat the correct protocol corresponding to the client system is used).

A communications rules provider module 410 can implement one or morecommunication rules that relate to details of signal transmissions orreceipt. For example, a rule may specify or constrain a protocol to beused, a transmission time, a type of link or connection to be used, adestination device, and/or a number of destination devices. A rule maybe generally applicable or conditionally applicable (e.g., only applyingfor messages corresponding to a particular app, during a particular timeof day, while a device is in a particular geographical region, when ausage of a local device resource exceeds a threshold, etc.). Forexample, a rule can identify a technique for selecting between a set ofpotential destination devices based on attributes of the set ofpotential destination devices as tracked by communication configuremodule 408. To illustrate, a device having a short response latency maybe selected as a destination device. As another example, communicationsrules provider 410 can maintain associations between various devices orsystems and resources. Thus, messages corresponding to particularresources can be selectively transmitted to destinations having accessto such resources.

A variety of application modules 412 can be configured to initiatemessage transmission, process incoming transmissions, facilitateselective granting of resource access, facilitate processing of requestsfor resource access, and/or performing other functions. In the instancedepicted in FIG. 4, application modules 412 include an auto-updatermodule 414, a resource access coordinator module 416, and/or a codeverification module 418.

Auto-updater module 414 automatically updates stored data and/or agentsoftware based on recent changes to resource utilization, availabilityor schedules and/or updates to software or protocols. Such updates canbe pushed from another device (e.g., upon detecting a change in aresource availability or access permit) or can be received in responseto a request sent by device 400. For example, device 400 can transmit asignal to another device that identifies a particular resource, and aresponsive signal can identify availabilities of access to the resource(e.g., available seat reservations for a sporting event or concert). Asanother example, device 400 can transmit a signal that includes anaccess access-enabling code, and a responsive signal can indicatewhether the code is applicable for access of a particular resourceand/or is valid.

In some instances, auto-updater module 414 is configured to enable theagent software to understand new, messages, commands, and/or protocols,based on a system configuration/change initiated on another device.Auto-updater module 414 may also install new or updated software toprovide support and/or enhancements, based on a system configurationchange detected on device 400. System configuration changes that wouldnecessitate changes to the agent software can include, but are notlimited to, a software/hardware upgrade, a security upgrade, a routerconfiguration change, a change in security settings, etc. For example,if auto-updater module 414 determines that a communication link withanother device has been lost for a pre-determined amount of time,auto-updater module 414 can obtain system configuration information tohelp re-establish the communication link. Such information may includenew settings/configurations on one or more hardware devices or new orupgraded software on or connected to device 400. Thus, auto-updatermodule 414 can detect or be informed by other software when there is anew version of agent software with additional functionality and/ordeficiency/bug corrections or when there is a change with respect to thesoftware, hardware, communications channel, etc.), and perform updatesaccordingly.

Based on the newly obtained system configuration for device 400,auto-updater module 414 can cause a new communication link to bere-established with another device. In one embodiment, uponestablishment of the communication link, system configurationinformation about device 400 can also be provided to another device tofacilitate the connection to or downloading of software to device 400.

In one embodiment, when a poor health signal is detected by anotherdevice (e.g., when the health signal is only sporadically received butthe communication link is not necessarily lost), the other device cansend a command to auto-updater module 414 to instruct auto-updatermodule 414 to obtain system configuration information about device 400.The updated system configuration information may be used in an attemptto revive the unhealthy communications link (e.g., by resending aresource request). For example, code can utilize appropriate systemcalls for the operating system to fix or reestablish communications. Byway of example and not limitation, model and driver information isoptionally obtained for routers in the system in order querying them. Byway of further example, if the code determines that a new brand ofrouter has been installed, it can adapt to that change, or to the changein network configuration, or other changes.

Instead or in addition, the host server (e.g., via communicationsmanager 406) can send specific instructions to auto-updater module 414to specify tests or checks to be performed on device 400 to determinethe changes to the system configurations (e.g., by automaticallyperforming or requesting an inventory check of system hardware and/orsoftware). For example, the components involved in the chain of hopsthrough a network can be queried and analyzed. Thus, for example, if anew ISP (Internet service provider) is being used and the managementsystem traffic is being filtered, or a new router was installed and thesoftware needs to change its configuration, or if someone made a changeto the operating system that affects port the management system is usingto communicate, the management system (or operator) can communicate withthe ISP, change it back, or choose from a new available port,respectively.

The specific tests may be necessary to help establish the communicationlink, if, for example, the automatic tests fail to provide sufficientinformation for the communication link to be re-established, ifadditional information is needed about a particular configurationchange, and/or if the client system is not initially supported by theauto-updater module 414, etc.

Auto-updater module 414 can also receive signals identifying updatespertaining to current or future availability of resources and/or accesspermits. Based on the signals, auto-updater module 414 can modify, addto or delete stored data pertaining to resource availabilities, resourceschedules and/or valid access permits. For example, upon receiving anupdate signal, auto-updater 414 can modify data stored in one or moredata stores 422, such as an account data store 424, resourcespecification data store 426, resource status data store 428 and/oraccess-enabling code data store 430.

Account data store 424 can store data for entities, such asadministrators, intermediate-system agents and/or users. The accountdata can include login information (e.g., username and password),identifying information (e.g., name, residential address, phone number,email address, age and/or gender), professional information (e.g.,occupation, affiliation and/or professional position), preferences(e.g., regarding event types, performers, seating areas, and/or resourcetypes), purchase data (e.g., reflecting dates, prices and/or items ofpast purchases) and/or payment data (e.g., credit card number andexpiration date or payment account information). The account data canalso or alternatively include technical data, such a particular entitycan be associated with one or more device types, IP addresses, browseridentifier and/or operating system identifier).

Resource specification data store 426 can store specification datacharacterizing each of one or more resources. For example, specificationdata for a resource can include a processing power, available memory,operating system, compatibility, device type, processor usage, powerstatus, device model, number of processor cores, types of memories, dateand time of availability, a performing entity, a venue of the eventand/or a set of seats (e.g., a chart or list). Specification data canfurther identify, for example, a cost for each of one or more accessrights.

Resource status data store 428 can store status data reflecting whichresources are available (or unavailable), thereby indicating whichresources have one or more open assignments. In some instances, thestatus data can include schedule information about when a resource isavailable. Status data can include information identifying an entity whorequested, reserved or was assigned a resource. In some instances,status information can indicate that a resource is being held orreserved and may identify an entity associated with the hold or reserveand/or a time at which the hold or reservation will be released.

Access-enabling code data store 430 can store access-enabling code datathat includes one or more codes and/or other information that can beused to indicate that an entity is authorized to use, have or receive aresource. An access-enabling code can include, for example, a numericstring, an alphanumeric string, a text string, a 1-dimensional code, a2-dimensional code, a barcode, a quick response (QR) code, an image, astatic code and/or a temporally dynamic code. An access-enabling codecan be, for example, unique across all instances, resource types and/orentities. For example, access-enabling codes provided in association fortickets to a particular resource (e.g., event) can be unique relative toeach other. In some instances, at least part of a code identifies aresource or specification of a resource. For example, for anaccess-enabling code for (e.g., ticket to) a concert, various portionsof a code may reflect: a performing entity, resource location, date,section and access-permitted location identifier.

One or more of data stores 424, 426, 428, and 430 can be a relationaldata store, such that elements in one data store can be referencedwithin another data store. For example, resource status data store 428can associate an identifier of a particular ticket with an identifier ofa particular entity. Additional information about the entity can then beretrieved by looking up the entity identifier in account data store 424.

Updates to data stores 424, 426, 428, and 430 facilitated and/orinitiated by auto-updater module 414 can improve cross-device dataconsistency. Resource access coordinator module 416 can coordinateresource access by, for example, generating and distributingidentifications of resource availabilities; processing requests forresource access; handling competing requests for resource access; and/orreceiving and responding to resource-offering objectives.

FIG. 5 illustrates example components of resource access coordinatormodule 416 that may operate, at least in part, at an access managementsystem (e.g., access management system) according to an embodiment ofthe invention. A resource specification engine 502 can identify one ormore available resources. For example, resource specification engine 502can detect input that identifies a current or future availability of anew resource.

Resource specification engine 502 can identify one or morespecifications of each of one or more resources. A specification caninclude an availability time period. For example, resource specificationengine 502 can determine that a resource is available, for example, at aparticular date and time (e.g., as identified based on input), for atime period (e.g., a start to end time), as identified in the input,and/or from a time of initial identification until another inputindicating that the resource is unavailable is detected. A specificationcan also or alternatively include a location (e.g., a geographiclocation and/or venue) of the resource. A specification can also oralternatively include one or more parties associated with the resource(e.g., performing acts or teams). Resource specification engine 502 canstore the specifications in association with an identifier of theresource in resource specifications data store 426.

A resource-access allocation engine 504 can allocate access rights forindividual resources. An access right can serve to provide an associatedentity with the right or a priority to access a resource. Because (forexample) association of an access right with an entity can, in someinstances, be conditioned on payment of a fee (e.g., or value of anaccess right) or authorization thereof, an allocated access right can beinitially unassociated with particular entities (e.g., users). Forexample, an allocated right can correspond to one or more accesscharacteristics, such as an processor identifier, a usage time, a memoryallocation, a geographic location (e.g., section or seat identifier),and/or a fee. For an allocated access right, resource-access allocationengine 504 can store an identifier of the right in resource statusesdata store 428 in association with an identifier for the resource and anindication that it has not yet been assigned to a particular entity.

A communication engine 506 can facilitate communicating the availabilityof the resource access rights to users. In some instances, a publisherengine 508 generates a presentation that identifies a resource andindicates that access rights are available. Initially or in response touser interaction with the presentation, the presentation can identifyaccess characteristics about available access rights. The presentationcan include, for example, a chart that identifies available accessrights for an event and corresponding fees. Publisher engine 508 candistribute the presentation via, for example, a website, app page, emailand/or message. The presentation can be further configured to enable auser to request assignments of one or more access rights.

In some instances, an intermediate system coordination engine 510 canfacilitate transmission of information about resource availability(e.g., resource specifications and characteristics of resource-accessrights) to one or more intermediate systems (e.g., by generating one ormore messages that include such information and/or facilitatingpublishing such information via a website or app page). Each of the oneor more intermediate systems can publish information about the resourceand accept requests for resource access. In some instances, intermediatesystem coordination engine 510 identifies different access rights asbeing available to individual intermediate systems to coordinateassignment. For example, access rights for seats in Section 1 may beprovided for a first intermediate system to assign, and access rightsfor seats in Section 2 may be provided to a second intermediate systemto assign.

In some instances, overlapping access rights are made available tomultiple intermediate systems to coordinate assignments. For example,some or all of a first set of resource rights (e.g., corresponding to asection) may be provided to first and second intermediate systems. Insuch instances, intermediate system coordination engine 510 can respondto a communication from a first intermediate system indicating that arequest has been received (e.g., and processed) for an access right inthe set) by sending a notification to one or more other intermediatesystems that indicates that the access right is to be at leasttemporarily (or entirely) made unavailable.

Intermediate system coordination engine 510 can monitor communicationchannels with intermediate systems to track the health and security ofthe channel. For example, a healthy connection can be inferred whenscheduled signals are consistently received. Further, intermediatesystem coordination engine 510 can track configurations of intermediatesystems (e.g., via communications generated at the intermediate systemsvia a software agent that identifies such configurations) so as toinfluence code generation, communication format, and/or provisions oraccess rights.

Thus, either via a presentation facilitated by publisher engine 508(e.g., via a web site or app page) or via communication with anintermediate system, a request for assignment of an access right can bereceived. A request management engine 512 can process the request.Processing the request can include determining whether all otherrequired information has been received, such as user-identifyinginformation (e.g., name), access-right identifying information (e.g.,identifying a resource and/or access-right characteristic) user contactinformation (e.g., address, phone number, and/or email address), and/oruser device information (e.g., type of device, device identifier, and/orIP address).

When all required information has not been received, request managementengine 512 can facilitate collection of the information (e.g., via awebpage, app page or communication to an intermediate system). Requestmanagement engine 512 can also or alternatively collect paymentinformation, determine that payment information has been received,obtain authorization of payment, determine that payment has beenauthorized (e.g., via an intermediate system), collect payment, and/ordetermine that payment has been collected. For example, publisher engine508 may receive a credit card number and expiration date via a webpage,and request management engine 512 can request authorization for anamount of the requested access rights. In some instances, paymentassessments are performed subsequent to at least temporary assignmentsof access rights. In some instances, request management engine 512retrieves data from a user account. For example, publisher engine 508may indicate that a request for an access right has been received whilea user was logged into a particular account. Request management engine512 may then retrieve, for example, contact information, deviceinformation, and/or preferences and/or payment information associatedwith the account from account data store 424.

In some instances, request management engine 512 prioritizes requests,such as requests for overlapping, similar or same access rights (e.g.,requests for access rights associated with a same section) receivedwithin a defined time period. The prioritization can be based on, forexample, times at which requests were received (e.g., prioritizingearlier requests), a request parameter (e.g., prioritizing requests fora higher or lower number of access rights above others), whetherrequests were received via an intermediate system (e.g., prioritizingsuch requests lower than others), intermediate systems associated withrequests (e.g., based on rankings of the systems), whether requests wereassociated with users having established accounts, and/or whetherrequests were associated with inputs indicative of a bot initiating therequest (e.g., shorter inter-click intervals, failed CAPTCHA tests,purchase history departing from a human profile).

Upon determining that required information has been received andrequest-processing conditions have been met, request management engine512 can forward appropriate request information to a resource schedulingengine 514. For a request, resource scheduling engine 514 can queryresource status data store 428 to identify access rights matchingparameters of the request.

In some instances, the request has an access-right specificity matchinga specificity at which access rights are assigned. In some instances,the request is less specific, and resource scheduling engine 514 canthen facilitate an identification of particular rights to assign. Forexample, request management engine 512 can facilitate a communicationexchange by which access right characteristics matching the request areidentified, and a user is allowed to select particular rights. Asanother example, request management engine 512 can itself select fromamongst matching access rights based on a defined criterion (e.g., bestsummed or averaged access-right ranking, pseudo-random selection, or aselection technique identified based on user input).

Upon identifying appropriately specific access rights, resourcescheduling engine 514 can update resource status data store 428 so as toplace the access right(s) on hold (e.g., while obtaining paymentauthorization and/or user confirmation) and/or to change a status of theaccess right(s) to indicate that they have been assigned (e.g.,immediately, upon receiving payment authorization or upon receiving userconfirmation). Such assignment indication may associate informationabout the user (e.g., user name, device information, phone number and/oremail address) and/or assignment process (e.g., identifier of anyintermediate system and/or assignment date and time) with an identifierof the access right(s).

For individual assigned access rights, an encoding engine 516 cangenerate an access-enabling code. The access-enabling code can include,for example, an alphanumeric string, a text string, a number, a graphic,a barcode (e.g., a 1-dimensional or 2-dimensional barcode), a staticcode, a dynamic code (e.g., with a feature depending on a current time,current location or communication) and/or a technique for generating thecode (e.g., whereby part of the code may be static and part of the codemay be determined using the technique). The code may be unique acrossall access rights, all access rights for a given resource, all accessrights associated with a given location, all access rights associatedwith a given time period, all resources and/or all users. In someinstances, at least part of the code is determined based on or isthereafter associated with an identifier of a user, user deviceinformation, a resource specification and/or an access rightcharacteristic.

In various embodiments, the code may be generated prior to allocatingaccess rights (e.g., such that each of some or all allocated accessrights are associated with an access-enabling code), prior to or whileassigning one or more access right(s) responsive to a request (e.g.,such that each of some or all assigned access rights are associated withan access-enabling code), at a prescribed time, and/or when the deviceis at a defined location and/or in response to user input. The code maybe stored at or availed to a user device. In various instances, at theuser device, an access-enabling code may be provided in a manner suchthat it is visibly available for user inspection or concealed from auser. For example, a ticket document with a barcode may be transmittedto a user device, or an app on the user device can transmit a requestwith a device identifier for a dynamic code.

Encoding engine 516 can store the access-enabling codes inaccess-enabling code data store 430. Encoding engine 516 can also oralternatively store an indication in account data store 424 that theaccess right(s) have been assigned to the user. It will again beappreciated that data stores 424, 426, 428, and 430 can be relationaland/or linked, such that, for example, an identification of anassignment can be used to identify one or more access rights, associatedaccess-enabling code(s) and/or resource specifications.

Resource scheduling engine 514 can facilitate one or more transmissionsof data pertaining to one or more assigned access rights to a device ofa user associated with the assignment and/or to an intermediate systemfacilitating the assignment and/or having transmitted a correspondingassignment request. The data can include an indication that accessrights have been assigned and/or details as to which rights have beenassigned. The data can also or alternatively include access-enablingcodes associated with assigned access rights.

While FIG. 5 depicts components of resource access coordinator module516 that may be present on an access management system 120, it will beappreciated that similar or complementary engines may be present onother systems. For example, a communication engine on a user device canbe configured to display presentations identifying access rightavailability, and a request management engine on a user device can beconfigured to translate inputs into access-right requests to send to anintermediate system or access management system.

Returning to FIG. 4, code verification module 418 (e.g., at a userdevice or client device) can analyze data to determine whether anaccess-enabling code is generally valid and/or valid for a particularcircumstance. The access-enabling code can include one that is receivedat or detected by device 400. The analysis can include, for example,determining whether all or part of the access-enabling code matches onestored in access-enabling code data store 430 or part thereof, whetherthe access-enabling code has previously been applied, whether all orpart of the access-enabling code is consistent with itself or otherinformation (e.g., one or more particular resource specifications, acurrent time and/or a detected location) as determined based on aconsistency analysis and/or whether all or part of the access-enablingcode has an acceptable format.

For example, access-enabling code data store 430 can be organized in amanner such that access-enabling codes for a particular resource, date,resource group, client, etc. can be queried to determine whether anysuch access-enabling codes correspond to (e.g. match) one beingevaluated, which may indicate that the code is verified. Additionalinformation associated with the code may also or alternatively beevaluated. For example, the additional information can indicate whetherthe code is currently valid or expired (e.g., due to a previous use ofthe code).

As another example, a portion of an access-enabling code can include anidentifier of a user device or user account, and code verificationmodule 418 can determine whether the code-identified device or accountmatches that detected as part of the evaluation. To illustrate, device400 can be a client device that electronically receives a communicationwith an access-enabling code from a user device. The communication canfurther include a device identifier that identifies, for example, thatthe user device is a particular type of smartphone. Code verificationmodule 418 can then determine whether device-identifying information inthe code is consistent with the identified type of smartphone.

As yet another example, code verification module 418 can identify a codeformat rule that specifies a format that valid codes are to have. Toillustrate, the code format rule may identify a number of elements thatare to be included in the code or a pattern that is to be present in thecode. Code verification module 418 can then determine that a code is notvalid if it does not conform to the format.

Verification of an access-enabling code can indicate that access to aresource is to be granted. Conversely, determining that a code is notverified can indicate that access to a resource is to be limited orprevented. In some instances, a presentation is generated (e.g., andpresented) that indicates whether access is to be granted and/or aresult of a verification analysis. In some instances, access grantingand/or limiting is automatically affected. For example, upon a codeverification, a user device and/or user may be automatically permittedto access a particular resource. Accessing a resource may include, forexample, using a computational resource, possessing an item, receiving aservice, entering a geographical area, and/or attending an event (e.g.,generally or at a particular location).

Verification of an access-enabling code can further trigger amodification to access-enabling code data store 430. For example, a codethat has been verified can be removed from the data store or associatedwith a new status. This modification may limit attempts to use a samecode multiple times for resource access.

A combination of modules 414, 416, 418 comprise a secure addressableendpoint agent 420 that acts as an adapter and enables cross-deviceinterfacing in a secure and reliable fashion so as to facilitateallocation of access-enabling codes and coordinate resource access.Secure addressable endpoint agent 420 can further generate a healthsignal that is transmitted to another device for monitoring of a statusof a communication channel. The health signal is optionally a shortmessage of a few bytes or many bytes in length that may be transmittedon a frequent basis (e.g., every few milliseconds or seconds). Acommunications manager 406 on the receiving device can then monitors thehealth signal provided by the agent to ensure that the communicationlink between the host server and device 400 is still operational.

In some instances, device 400 can include (or can be in communicationwith) a physical access control 432. Physical access control 432 caninclude a gating component that can be configured to provide a physicalbarrier towards accessing a resource. For example, physical accesscontrol 432 can include a turnstile or a packaging lock.

Physical access control 432 can be configured such that it can switchbetween two modes, which differ in terms of a degree to which useraccess to a resource is permitted. For example, a turnstile may have alocked mode that prevents movement of an arm of the turnstile and anunlocked mode that allows the arm to be rotated. In some instances, adefault mode is the mode that is more limiting in terms of access.

Physical access control 432 can switch its mode in response to receivingparticular results from code verification module 418. For example, uponreceiving an indication that a code has been verified, physical accesscontrol 432 can switch from a locked mode to an unlocked mode. It mayremain in the changed state for a defined period of time or until anaction or event is detected (e.g., rotation of an arm).

Device 400 can also include one or more environmental sensors 434.Measurements from the sensor can processed by one or more applicationmodules. Environmental sensor(s) 434 can include a global positioningsystem (GPS) receiver 435 that can receive signals from one or more GPSsatellites. A GPS chipset can use the signals to estimate a location ofdevice 400 (e.g., a longitude and latitude of device 400). The estimatedlocation can be used to identify a particular resource (e.g., one beingoffered at or near the location at a current or near-term time). Theidentification of the particular resource can be used, for example, toidentify a corresponding (e.g., user-associated) access-enabling code orto evaluate an access-enabling code (e.g., to determine whether itcorresponds to a resource associated with the location).

The estimated location can further or alternatively be used to determinewhen to perform a particular function. For example, at a user device,detecting that the device is in or has entered a particular geographicalregion (e.g., is within a threshold distance from a geofence perimeteror entrance gate) can cause the device to retrieve or request anaccess-enabling code, conduct a verification analysis of the code and/ortransmit the code to a client device.

It will be appreciated that environmental sensor(s) 434 can include oneor more additional or alternative sensors aside from GPS receiver 435.For example, a location of device 400 can be estimated based on signalsreceived by another receive from different sources (e.g., base stations,client point devices or Wi Fi access points). As another example, anaccelerometer and/or gyroscope can be provided. Data from these sensorscan be used to infer when a user is attempting to present anaccess-enabling code for evaluation.

It will also be appreciated that the components and/or engines depictedin figures herein are illustrative, and a device need not include eachdepicted component and/or engine and/or can include one or moreadditional components and/or engines. For example, a device can alsoinclude a user interface, which may include a touch sensor, keyboard,display, camera and/or speakers. As another example, a device caninclude a power component, which can distribute power to components ofthe device. The power component can include a battery and/or aconnection component for connecting to a power source. As yet anotherexample, a module in the application layer can include an operatingsystem. As still another example, an application-layer control processormodule can provide message processing for messages received from anotherdevice. The message processing can include classifying the message androuting it to the appropriate module. To illustrate, the message can beclassified as a request for resource access or for an access-enablingcode, an update message or an indication that a code has been redeemedor verified. The message processing module can further convert a messageor command into a format that can interoperate with a target module.

It will further be appreciated that the components, modules and/oragents could be implemented in one or more instances of software. Thefunctionalities described herein need not be implemented in separatemodules, for example, one or more functions can be implemented in onesoftware instance and/or one software/hardware combination. Othercombinations are similarly be contemplated.

Further yet, it will be appreciated that a storage medium (e.g., usingmagnetic storage media, flash memory, other semiconductor memory (e.g.,DRAM, SRAM), or any other non-transitory storage medium, or acombination of media, and can include volatile and/or non-volatilemedia) can be used to store program code for each of one or more of thecomponents, modules and/or engines depicted in FIGS. 4 and 5 and/or tostore any or all data stores depicted in FIG. 4 or described withreference to FIGS. 4 and/or 5. Any device or system disclosed herein caninclude a processing subsystem for executing the code. The processingsystem can be implemented as one or more integrated circuits, e.g., oneor more single-core or multi-core microprocessors or microcontrollers,examples of which are known in the art.

FIG. 6 illustrates a flowchart of an embodiment of a process 600 forassigning access rights for resources. Process 600 can be performed byan access management system, such as access management system 120.Process 600 begins at block 605 where resource specification engine 502identifies one or more specifications for a resource. The specificationscan include, for example, a time at which the resource is to beavailable, a location of the resource, a capacity of the resourcesand/or one or more entities (e.g., performing entities) associated withthe resource.

At block 610, resource-access allocation engine 504 allocates a set ofaccess rights for the resource. In some instances, each of at least someof the access rights corresponds to a different access parameter, suchas a different location (e.g., seat) assignment. Upon allocation, eachof some or all of the access rights may have a status as available. Asubset of the set of access rights can be immediately (or at a definedtime) assigned or reserved according to a base assignment or reservationrule (e.g., assigning particular access rights to particular entities,who may be involved in or related to provision of the resource and/orwho have requested or been assigned a set of related access rights.

At block 615, communication engine 506 transmits the resourcespecifications and data about the access rights. The transmission canoccur in one or more transmissions. The transmission can be to, forexample, one or more user devices and/or intermediate systems. In someinstances, a notification including the specifications and access-rightdata is transmitted, and in some instances, a notification can begenerated at a receiving device based on the specifications andaccess-right data. The notification can include, for example, a websitethat identifies a resource (via, at least in part, its specifications)and indicates that access rights for the resource are available forassignment. The notification can include an option to request assignmentof one or more access rights.

At block 620, request management engine 512 receives a request for oneor more access rights to be assigned to a user. The request can, forexample, identify particular access rights and/or access parameters. Therequest can include or be accompanied by other information, such asidentifying information. In some instances, the access management systemcan use at least some of such information to determine whether a fee forthe access rights has been authorized. In some instances, the request isreceived via an intermediate system that has already handled suchauthorization.

At block 625, resource scheduling engine 514 assigns the requested oneor more access rights to the user. The assignment can be conditioned onreceipt of all required information, confirmation that the accessright(s) have remained available for assignment, determining using datacorresponding to the request that a bot-detection condition is notsatisfied, fee provision and/or other defined conditions. Assignment ofthe access right(s) can include associating an identifier of each of theone or more rights with an identifier of a user and/or assignment and/orchanging a status of the access right(s) to assigned. Assignment of theaccess right(s) can result in impeding or preventing other users fromrequesting the access right(s), being assigned the access right(s)and/or being notified that the access right(s) are available forassignment. Assignment of the access right(s) can, in some instances,trigger transmission of one or more communications to, for example, oneor more intermediate systems identifying the access right(s) andindicating that they have been assigned and/or with an instruction tocease offering the access rights.

At block 630, encoding engine 516 generates an access-enabling code foreach of the one or more access rights. The code can be generated, forexample, as part of the assignment, as part of the allocation orsubsequent to the assignment (e.g., upon detecting that a user isrequesting access to the resource). Generating an access-enabling codecan include applying a code-generation technique, such on one thatgenerates a code based on a characteristic of a user, user device,current time, access right, resource, intermediate system or othervariable. The access-enabling code can include a static code that willnot change after it has been initially generated or a dynamic code thatchanges in time (e.g., such that block 630 can be repeated at varioustime points).

At block 635, communication engine 506 transmits a confirmation of theassignment and the access-enabling code(s) in one or more transmissions.The transmission(s) may be sent to one or more devices, such as a userdevice having initiated the request from block 620, a remote server oran intermediate system having relayed the request from block 620.

Referring to FIG. 7A, an embodiment of a site system 180 is shown inrelation to mobile devices 724-n, Network Attached Storage (NAS) 750,site network 716 and the Internet 728. In some embodiments, forattendees of a live event or concert, site network 716 and site system180 provide content, services and/or interactive engagement using mobiledevices 724. Connections to site system 180 and site network 716 can beestablished by mobile devices 724 connecting to access points 720.Mobile devices 724 can be a type of end user device 110 that isportable, e.g., smartphones, mobile phones, tablets, and/or othersimilar devices.

Site network 716 can have access to content (information aboutattendees, videos, pictures, music, trivia information, etc.) held byNAS 750. Additionally, as described herein, content can be gathered fromattendees both before and during the event. By connecting to sitenetwork 716, mobile device 724 can send content for use by site system180 or display content received from NAS 750.

Referring to FIG. 7B, another embodiment of a site system 180 is shownin relation to mobile devices 724-n, Network Attached Storage (NAS) 750,site network 716 and the Internet 728, in an embodiment. FIG. 7Badditionally includes phone switch 740. In some embodiments, phoneswitch 740 can be a private cellular base station configured to spoofthe operation of conventionally operated base stations. Using phoneswitch 740 at an event site allows site system 180 to provide additionaltypes of interactions with mobile devices 724. For example, without anysetup or configuration to accept communications from site controller712, phone switch 740 can cause connected mobile devices 724 to ringand, when answered, have an audio or video call be established. Whenused with other embodiments described herein, phone switch 740 canprovide additional interactions. For example, some embodiments describedherein use different capabilities of mobile devices 724 to cause masssounds and/or establish communications with two or more people. Bycausing phones to ring and by establishing cellular calls, phone switchcan provide additional capabilities to these approaches.

FIG. 8 shows a block diagram of user device 110 according to anembodiment. User device 110 includes a handheld controller 810 that canbe sized and shaped so as enable the controller and user device 110 in ahand. Handheld controller 810 can include one or more user-deviceprocessors that can be configured to perform actions as describedherein. In some instances, such actions can include retrieving andimplementing a rule, retrieving an access-enabling code, generating acommunication (e.g., including an access-enabling code) to betransmitted to another device (e.g., a nearby client-associated device,a remote device, a central server, a web server, etc.), processing areceived communication (e.g., to perform an action in accordance with aninstruction in the communication, to generate a presentation based ondata in the communication, or to generate a response communication thatincludes data requested in the received communication) and so on.

Handheld controller 810 can communicate with a storage controller 820 soas to facilitate local storage and/or retrieval of data. It will beappreciated that handheld controller 810 can further facilitate storageand/or retrieval of data at a remote source via generation ofcommunications including the data (e.g., with a storage instruction)and/or requesting particular data.

Storage controller 820 can be configured to write and/or read data fromone or more data stores, such as an application storage 822 and/or auser storage 824. The one or more data stores can include, for example,a random access memory (RAM), dynamic random access memory (DRAM),read-only memory (ROM), flash-ROM, cache, storage chip, and/or removablememory. Application storage 822 can include various types of applicationdata for each of one or more applications loaded (e.g., downloaded orpre-installed) onto user device 110. For example, application data caninclude application code, settings, profile data, databases, sessiondata, history, cookies and/or cache data. User storage 824 can include,for example, files, documents, images, videos, voice recordings and/oraudio. It will be appreciated that user device 110 can also includeother types of storage and/or stored data, such as code, files and datafor an operating system configured for execution on user device 110.

Handheld controller 810 can also receive and process (e.g., inaccordance with code or instructions generated in correspondence to aparticular application) data from one or more sensors and/or detectionengines. The one or more sensors and/or detection engines can beconfigured to, for example, detect a presence, intensity and/or identifyof (for example) another device (e.g., a nearby device or devicedetectable over a particular type of network, such as a Bluetooth,Bluetooth Low-Energy or Near-Field Communication network); anenvironmental, external stimulus (e.g., temperature, water, light,motion or humidity); an internal stimulus (e.g., temperature); a deviceperformance (e.g., processor or memory usage); and/or a networkconnection (e.g., to indicate whether a particular type of connection isavailable, a network strength and/or a network reliability).

FIG. 8 shows several exemplary sensors and detection engines, includinga peer monitor 830, accelerometer 832, gyroscope 834, light sensor 836and location engine 838. Each sensor and/or detection engine can beconfigured to collect a measurement or make a determination, forexample, at routine intervals or times and/or upon receiving acorresponding request (e.g., from a processor executing an applicationcode).

Peer monitor 830 can monitor communications, networks, radio signals,short-range signals, etc., which can be received by a receiver of userdevice 110) Peer monitor 830 can, for example, detect a short-rangecommunication from another device and/or use a network multicast orbroadcast to request identification of nearby devices. Upon or whiledetecting another device, peer monitor 830 can determine an identifier,device type, associated user, network capabilities, operating systemand/or authorization associated with the device. Peer monitor 530 canmaintain and update a data structure to store a location, identifierand/or characteristic of each of one or more nearby user devices.

Accelerometer 832 can be configured to detect a proper acceleration ofuser device 110. The acceleration may include multiple componentsassociated with various axes and/or a total acceleration. Gyroscope 834can be configured to detect one or more orientations (e.g., viadetection of angular velocity) of user device 110. Gyroscope 834 caninclude, for example, one or more spinning wheels or discs, single- ormulti-axis (e.g., three-axis) MEMS-based gyroscopes.

Light sensor 836 can include, for example, a photosensor, such asphotodiode, active-pixel sensor, LED, photoresistor, or other componentconfigured to detect a presence, intensity and/or type of light. In someinstances, the one or more sensors and detection engines can include amotion detector, which can be configured to detect motion. Such motiondetection can include processing data from one or more light sensors(e.g., and performing a temporal and/or differential analysis).

Location engine 838 can be configured to detect (e.g., estimate) alocation of user device 110. For example, location engine 838 can beconfigured to process signals (e.g., a wireless signal, GPS satellitesignal, cell-tower signal, iBeacon, or base-station signal) received atone or more receivers (e.g., a wireless-signal receiver and/or GPSreceiver) from a source (e.g., a GPS satellite, cellular tower or basestation, or WiFi access point) at a defined or identifiable location. Insome instances, location engine 838 can process signals from multiplesources and can estimate a location of user device 110 using atriangulation technique. In some instances, location engine 838 canprocess a single signal and estimate its location as being the same as alocation of a source of the signal.

User device 110 can include a flash 842 and flash controller 846. Flash842 can include a light source, such as (for example), an LED,electronic flash or high-speed flash. Flash controller 846 can beconfigured to control when flash 842 emits light. In some instances, thedetermination includes identifying an ambient light level (e.g., viadata received from light sensor 836) and determining that flash 842 isto emit light in response to a picture- or movie-initiating input whenthe light level is below a defined threshold (e.g., when a setting is inan auto-flash mode). In some additional or alternative instances, thedetermination includes determining that flash 846 is, or is not, to emitlight in accordance with a flash on/off setting. When it is determinedthat flash 846 is to emit light, flash controller 846 can be configuredto control a timing of the light so as to coincide, for example, with atime (or right before) at which a picture or video is taken.

User device 110 can also include an LED 840 and LED controller 844. LEDcontroller 844 can be configured to control when LED 840 emits light.The light emission may be indicative of an event, such as whether amessage has been received, a request has been processed, an initialaccess time has passed, etc.

Flash controller 846 can control whether flash 846 emits light viacontrolling a circuit so as to complete a circuit between a power sourceand flash 846 when flash 842 is to emit light. In some instances, flashcontroller 846 is wired to a shutter mechanism so as to synchronizelight emission and collection of image or video data.

User device 110 can be configured to transmit and/or receive signalsfrom other devices or systems (e.g., over one or more networks, such asnetwork(s) 170). These signals can include wireless signals, andaccordingly user device 110 can include one or more wireless modules 850configured to appropriately facilitate transmission or receipt ofwireless signals of a particular type. Wireless modules 850 can includea Wi-Fi module 852, Bluetooth module 854, near-field communication (NFC)module 856 and/or cellular module 856. Each module can, for example,generate a signal (e.g., which may include transforming a signalgenerated by another component of user device 110 to conform to aparticular protocol and/or to process a signal (e.g., which may includetransforming a signal received from another device to conform with aprotocol used by another component of user device 110).

Wi-Fi module 854 can be configured to generate and/or process radiosignals with a frequency between 2.4 gigahertz and 5 gigahertz. Wi-Fimodule 854 can include a wireless network interface card that includescircuitry to facilitate communicating using a particular standard (e.g.,physical and/or link layer standard).

Bluetooth module 854 can be configured to generate and/or process radiosignals with a frequency between 2.4 gigahertz and 2.485 gigahertz. Insome instances, bluetooth module 854 can be configured to generateand/or process Bluetooth low-energy (BLE or BTLE) signals with afrequency between 2.4 gigahertz and 2.485 gigahertz.

NFC module 856 can be configured to generate and/or process radiosignals with a frequency of 13.56 megahertz. NFC module 856 can includean inductor and/or can interact with one or more loop antenna.

Cellular module 858 can be configured to generate and/or processcellular signals at ultra-high frequencies (e.g., between 698 and 2690megahertz). For example, cellular module 858 can be configured togenerate uplink signals and/or to process received downlink signals.

The signals generated by wireless modules 850 can be transmitted to oneor more other devices (or broadcast) by one or more antennas 859. Thesignals processed by wireless modules 850 can include those received byone or more antennas 859. One or more antennas 859 can include, forexample, a monopole antenna, helical antenna, intenna, Planar Inverted-FAntenna (PIFA), modified PIFA, and/or one or more loop antennae.

User device 110 can include various input and output components. Anoutput component can be configured to present output. For example, aspeaker 862 can be configured to present an audio output by convertingan electrical signal into an audio signal. An audio engine 864 caneffect particular audio characteristics, such as a volume,event-to-audio-signal mapping and/or whether an audio signal is to beavoided due to a silencing mode (e.g., a vibrate or do-not-disturb modeset at the device).

Further, a display 866 can be configured to present a visual output byconverting an electrical signal into a light signal. Display 866 mayinclude multiple pixels, each of which may be individually controllable,such that an intensity and/or color of each pixel can be independentlycontrolled. Display 866 can include, for example, an LED- or LCD-baseddisplay.

A graphics engine 868 can determine a mapping of electronic image datato pixel variables on a screen of user device 110. It can further adjustlighting, texture and color characteristics in accordance with, forexample, user settings.

In some instances, display 866 is a touchscreen display (e.g., aresistive or capacitive touchscreen) and is thus both an input and anoutput component. A screen controller 870 can be configured to detectwhether, where and/or how (e.g., a force of) a user touched display 866.The determination may be made based on an analysis of capacitive orresistive data.

An input component can be configured to receive input from a user thatcan be translated into data. For example, as illustrated in FIG. 8, userdevice 110 can include a microphone 872 that can capture audio data andtransform the audio signals into electrical signals. An audio capturemodule 874 can determine, for example, when an audio signal is to becollected and/or any filter, equalization, noise gate, compressionand/or clipper that is to be applied to the signal.

User device 110 can further include one or more cameras 876, 880, eachof which can be configured to capture visual data (e.g., at a given timeor across an extended time period) and convert the visual data intoelectrical data (e.g., electronic image or video data). In someinstances, user device 110 includes multiple cameras, at least two ofwhich are directed in different and/or substantially oppositedirections. For example, user device 110 can include a rear-facingcamera 876 and a front-facing camera 880.

A camera capture module 878 can control, for example, when a visualstimulus is to be collected (e.g., by controlling a shutter), a durationfor which a visual stimulus is to be collected (e.g., a time that ashutter is to remain open for a picture taking , which may depend on asetting or ambient light levels; and/or a time that a shutter is toremain open for a video taking, which may depend on inputs), a zoom, afocus setting, and so on. When user device 110 includes multiplecameras, camera capture module 878 may further determine which camera(s)is to collect image data (e.g., based on a setting).

FIG. 9 illustrates sample components of an embodiment of site system180, including connections to NAS 750 and access management system 185.Embodiments of site controller 712 use network manager 920 to connectvia access points 720 (using e.g., WiFi 952, Bluetooth 953, NFC 956,Ethernet 958, and/or other network connections) to other networkcomponents, such as site network 716 and mobile devices 724. In someembodiments, site system 280 uses site controller 712 to control aspectsof an event venue. A broad variety of venue features can be controlledby different embodiments, including: permanent lights (e.g., withlighting controller 922), stage lights (e.g., with presentmentcontroller 924), stage display screens (e.g., with stage display(s)controller 912), permanent display screens (e.g., with permanentdisplay(s) controller 914), and the venue sound system (e.g., with thesound system controller 916).

A more detailed view of NAS 750 is shown, including NAS controller 930coupled to user video storage 932, captured video storage 934,preference storage 936, and 3D model 938. Captured video storage 934 canreceive, store and provide user videos received from mobile devices 724.In some embodiments, site controller 712 triggers the automatic captureof images, audio and video from mobile devices 724, such triggeringbeing synchronized to activities in an event. Images captured by thisand similar embodiments can be stored on both the capturing mobiledevice 724 and user video storage 932. In an embodiment, site controller712 can coordinate the transfer of information from mobile devices toNAS 750 (e.g., captured media) with activities taking place during theevent. When interacting with mobile devices 724, some embodiments ofsite controller 712 can provide end user interfaces 926 to enabledifferent types of interaction. For example, as a part of engagementactivities, site controller may offer quizzes and other content to thedevices. Additionally, with respect to location determinations discussedherein, site controller can supplement determined estimates withvoluntarily provided information using end user interfaces 926, storedin a storage that is not shown.

In some embodiments, to guide the performance of different activities,site controller 712 and/or other components may use executable code 938tangibly stored in code storage 939. In some embodiments, siteinformation storage 937 can provide information about the site, e.g.,events, seat maps, attendee information, geographic location ofdestinations (e.g., concessions, bathrooms, exits, etc.), as well as 3Dmodels of site features and structure.

Referring next to FIG. 10A, an example of a communication exchange 1000a involving primary load management system 1014 and each of a pluralityof secondary load management systems 1016 a, 1016 b is shown. In someinstances, secondary load management system 1016 a is managed by anentity different than an entity that manages secondary load managementsystem 1016 b. Primary load management system 1014 may include and/orshare properties with a primary assignment management system 214. Eachof one or both of secondary load management system 1016 a and 1016 b mayinclude or correspond to a secondary assignment system 216.Communications shown in FIG. 10 may be transmitted over one or morenetworks, such as network 270, the Internet and/or a short-rangenetwork.

In one instance, one of secondary load management system 1016 a or 1016b is managed by a same entity as manages primary load management system1014. In one instance, each of secondary load management system 1016 and1016 b is managed by an entity different than an entity managing primaryload management system 1014. Primary load management system 1014 caninclude a system that, for example, manages a master access-rightassignment data store, distributes access codes, performs verificationdata for access attempts, and so on. Secondary load management systems1016 a, 1016 b can include systems that, for example, facilitateassignment of access codes to users. For example, secondary loadmanagement systems 1016 a, 1016 b can be configured to requestallocation of access-right slots, which may result in a temporary orfinal allocation or assignment to the system, a hold on the access-rightslots, and/or a distribution of data pertaining to the slot(s).Secondary load management systems 1016 a, 1016 b may then facilitatetransmission of the access-right slots to one or more users and identifya user that has requested (e.g., and provided payment information for)one or more particular access-right slots. The secondary load managementsystem can then facilitate an assignment of the access-right slots by(for example) transmitting one or more access codes to the user device,identifying the user to primary load management system 1014 or updatingassignment data.

Communication exchange 1000 a begins with transmission of one or morerule specifications from each secondary load management system 1016 a,1016 b to primary load management system 1014. The rule specificationcan include one or more request parameters identify parameters of a loadrequested for allocation. For example, a rule specification can includea specification pertaining to a size of a desired load (e.g.,corresponding to a number of access-right slots, such as seats). Thespecification may include a particular number or a threshold. A rulespecification can include a specification of a type of at least part ofthe load, such as one that identifies a resource or type of resourceand/or one that identifies a characteristic of one or more access-rightslots (e.g., a location). The specification may include a firstallocation parameter that may identify a value for which access-rightslots are being requested.

In some instances, a rule and/or request corresponds to a singleresource, while in others, the rule and/or request corresponds tomultiple resources. For example, a request may be for access-rightresults pertaining to each of three resources or to each resourceavailable at a location in a season. Thus, in some instances, a rulespecification identifies or is indicative of a number of resources.Resources may, but need not, be specifically identified in a rulespecification, rule and/or request. For example, a rule specificationmay indicate that a defined number or range (e.g., 100-200) ofaccess-right slots is requested for any given resource within a definedtime period (e.g., year).

A rule specification can include an allocation parameter that identifiesa parameter for allocating a load should it be allocated to thesecondary load management system. To illustrate, secondary loadmanagement system 1016 a, 1016 b may be configured to receiveallocations of access-right slots but to attempt to facilitateassignment of the access-right slots to users. Communication exchange1000 a can be configured so as to promote facilitated distribution tousers upon allocation of access-right slots to a secondary loadmanagement system. Early provision of allocation parameters by asecondary load management system can promote such quick facilitateddistribution.

For example, an allocation parameter can identify one or morecommunication channels (e.g., webpages, portals,information-distribution protocols, email addresses, etc.) fortransmitting information pertaining to at least part of the load to eachof one or more devices and/or an a second allocation parameter. Thisinformation may enable primary load management system 1014 to (forexample) automatically provide information pertaining to allocatedaccess-right slots via the communication channel(s) and/or to verifythat allocation parameters comply with one or more primary-system rules(e.g., that may include an upper and/or lower threshold for anallocation parameter and/or limits on which communication channels maybe used).

Primary load management system 1014 can define a rule for each secondaryload management system 1016 a, 1016 b based on the rule specifications.The rules can be stored in a secondary system rules data store 1018.

Primary load management system 1014 can further include a load datastore 1020. Load data store 1020 can include, for example, informationpertaining to which access-right slots for a given resource areavailable and information pertaining to each of those slots. Load datastore 1020 can further identify information pertaining to one or moredefined loads, such as which access-right slots are corresponding to theload, to which secondary load management system a load has beenallocated, whether an allocation includes any restrictions (e.g., timelimits).

Primary load management system 1014 can assess whether a set ofavailable access-right slots corresponds to request parametersidentified in any secondary-system rules. For example, it can bedetermined whether a resource type corresponds to that specified in arequest parameter, whether a quantity (and/or contiguous quantity)corresponds to that specified in a request parameter, whether a type ofthe access-right slots corresponds to that specified in a requestparameter, and/or whether the quantity of access-right slots can beallocated for a value that corresponds to a first allocation parameterspecified in a request parameter (e.g., the determination being based ondefined values or thresholds associated with the access-right slotsand/or a primary-system rule).

In some instances, it may be determined that request parametersidentified in rules for multiple secondary load management systemcorrespond to a same load or to a same at least part of a load. Primaryload management system 1014 may include a switch, such as a contentswitch, that may evaluate a load, rules and/or systems to determine towhich secondary load management system 1016 a load is to be allocated oridentified. In these instances, the rules and/or systems may beprioritized to determine to which entity the load is to be allocated.The prioritization may depend on, for example, defined prioritizationsof the systems, a time at which rule specifications were submitted(e.g., prioritizing early submission), a size parameter (e.g.,prioritizing either lower or larger size requests), and/or firstallocation parameters (e.g., prioritizing larger first allocationparameters).

It will be appreciated that, in various instances, a load may begenerated in response to evaluation of a load (e.g., in an attempt todefine a load that accords with request parameters), or a load may befirst defined (e.g., based on which access-right slots remain availableand/or distribution priorities of the primary load management system)and it is then determined which rule to which the load corresponds. Insome instances, a primary-system rule as to which access-right slots areto be included in a load and/or a secondary-system rule as to whichaccess-right slots are requested may depend on information, such as anenvironmental characterization (e.g., weather forecast) corresponding toa resource, a throughput monitor (e.g., identifying a probability of aperforming entity in being positioned in a playoff or other game) and/ora discrepancy associated with a resource (e.g., a spread or lineassociated with a resource). In some instances, a primary-system ruleand/or secondary-system rule may include a function that relates anenvironmental characteristic, throughput characteristic and/ordiscrepancy with an allocation parameter (e.g., such that largerdiscrepancies, poorer environmental characteristics and/or lowerthroughput prospects result in lower allocation parameters).

When it is determined that a load corresponds to a secondary-system rule(and/or any prioritization is performed), primary load management systemcan transmit a trigger indication to the associated secondary loadmanagement system 1016 a. The trigger indication may identifycharacteristics of the load (e.g., a size, type of one or moreaccess-right slots, resource, and/or allocation value). In someinstances, the trigger indication may identify a rule and/or whatspecifications were defined in the triggered rule.

In some instances, communication exchange 1000 a is configured so as toprovide a secondary load management system 1016 a a defined time periodfor transmitting a request responsive to a trigger indication.Access-right slots may, but need not, be placed on hold for the timeperiod. Should a request not be received within the time period, primaryload management system 1014 may transmit a same or different triggerindication to another secondary load management system with a rulecorresponding to the load or may redefine a load so as to correspondwith a rule of another secondary load management system and transmit atrigger indication accordingly. In some instances, a trigger indicationis simultaneously transmitted to multiple secondary load managementsystems 1016, and a load may be allocated to a system that thereafterrequests the load (e.g., in accordance with a first-responder or othersecondary-system selection technique).

Secondary load management system 1016 a can then transmit a requestcommunication back to primary load management system that requests theload. Primary load management system 1014 can then transmit a responsecommunication that confirms that the load is being allocated. In someinstances, the response communication is transmitted subsequent to or intemporal proximity of a time at which a charge is issued or collectedfor the load. In some instances, then response communication includesfurther information about the load. For example, location ofaccess-right slots in the load may be more precisely identified.

Secondary load management system 1016 a can store data pertaining to theload in a load data store 1022. Load data store 1022 may further trackstatuses of access-right slots so as to be able to identify whichaccess-right slots have been assigned to users. Secondary loadmanagement system 1016 a can further manage and/or have access to aresource specification data store 1024 that can associate identifiers ofvarious resources with corresponding information. The resourcespecifications may be, for example, included in a trigger-information orresponse communication from primary load management system 1014;identified via an external search (e.g., web crawl), and so on. Resourcespecifications may include, for example, a location, one or moreperforming entities and/or a date and time.

A user device 1026 can also transmit rule specifications to one or moreof primary load management system 1014 and 1016 a. The rulespecifications may include request parameters, such as a sizespecification, type specification and/or assignment value (e.g., thatmay be precisely identified or a threshold). When rule specificationsare transmitted and/or availed to secondary load management system 1016a, a corresponding user rule can be defined for the user device and/oruser.

Secondary load management system 1016 a can distribute data of aresource (or multiple resources) corresponding to the load allocated tothe system. The resource data can include one or more resourcespecifications stored at resource specification data store 1024. Theresource data may further include data associated with one or moreaccess-right slots included in the load. For example, the resource datamay identify a time and location of a resource and a location of each ofone or more access-right slots. In some instances, the resource datafurther includes an allocation parameter, such as the second allocationparameter and/or one defined based thereupon included in asecondary-system rule specification or included in a rule associatedwith secondary load management system 1016 a.

In some instances, secondary load management system 1016 a controls thetransmission of the resource data to one or more user devices 1026. Insome instances, primary load management system 1014 facilitates thetransmission. For example, the data may be identified in a webpagehosted, controlled and/or managed by secondary load management system1016 a, but primary load management system 1016 may have authorizationto update the webpage, and thus primary load management system canupdate the secondary-system to include the resource data.

In some instances, resource data is selectively transmitted to userdevices. For example, resource data may be transmitted only to the userdevices associated with user rules corresponding with at least part ofthe load.

User device 1026 can request assignment of at least part of the load.The user request can identify, for example, one or more access-rightslots (e.g., and/or one or more resources). Secondary load managementsystem 1016 a can evaluate the request and respond with load responsedata. Such a response may be conditioned (for example) on confirmingpayment information. The load response data may (for example) indicatethat the assignment has been accepted and/or include confirmation data.Upon such acceptance, secondary load management system 1016 a can alsotransmit assignment data to primary load management system. The loaddata can include an identification of the user device (or correspondinginformation, such as a name, email, account, device identifier or phonenumber of a corresponding user) and/or one or more access-right slotsbeing assigned. Primary assignment management system can update anassignment data store and/or load data store 1020 to reflect theassignment.

Primary load management system 1014 can then retrieve access code datafrom an access code data store 1030 and transmit the access code data touser device 1026. The access code data can correspond to the one or moreaccess rights being assigned to the user. The access code data can betransmitted (for example) immediately, at a defined time (e.g., relativeto a time of a resource), or upon receiving a request (e.g., triggeredby a user input or detecting that a user device has crossed a geofencecorresponding to a resource).

User device 1026 can store the access code(s) in an access-code datastore 1030 b. Subsequently, user device 1026 can retrieve theaccess-code data and transmitting it to a site controller 712 (e.g.,upon detecting the site controller, upon receiving a request from thesite controller or in response to detecting a corresponding user input).Site controller 712 can include one located at a resource location. Sitecontroller 712 can transmit the access-code data to primary loadmanagement system 1014, which can then determine whether the code is avalid code, has not been previously redeemed and/or corresponds to oneor more characteristics (e.g., a resource associated with or identifiedby the site controller, a time, a device characteristic, etc.). A resultof such determination(s) can be transmitted back to site controller 712such that a user can then be granted or denied requested access to aresource.

It will be appreciated that one, more or all communications representedin communication exchange 1000 a can be transmitted via (for example) aweb site, a web portal, another portal, an email exchange, a message(e.g., SMS message) exchange, and/or an API.

It will be appreciated that part or all of a communication exchange canbe performed in an automated or semi-automated manner. For example, oneor more rules (e.g., secondary-system rules or user rules) can bedefined so as to trigger automatic allocation or assignment upondetecting data that corresponds to request parameters in the rules. Asanother example, the one or more rules can be defined so as to trigger anotification communication to the user device or secondary loadmanagement system that includes an alert that the request parameters aresatisfied and enable to user device or secondary load management systemto transmit a request for allocation or assignment.

It will also be appreciated that various modifications to communicationexchange 1000 a are contemplated. For example, in one instance,secondary load management system 1016 a may at least partly manageaccess codes. For example, one or more access codes corresponding to aload may be transmitted from primary load management system 1014 tosecondary load management system 1016 a as part of a response. Secondaryload management system 1016 a may then transmit select access codes to auser device 1026, and (in various instances) either primary loadmanagement system 1014 or secondary load management system 1016 a mayprovide verification of the code to site controller 712.

Referring next to FIG. 10B, another example of a communication exchange1000 b involving primary load management system 1014 and each of aplurality of secondary load management systems 1016 a, 1016 b is shown.In this instance, two different types of access code data are associatedwith an assignment.

As shown, in response to an initial assignment of an access-right slot,primary load management system 1014 transmits first access code data touser device 1026. The first access code data may include datarepresenting that access to a resource has been authorized. However, inthis instance, the first access code data may lack a precision ofassociation that would associate the first access code data with one ormore particular access characteristics. For example, the data may lackinformation that would identify a particular location within a resourcearea for which access is to be granted.

Subsequently (e.g., after a predefined time period, such as within adefined period from a resource time; and/or when a user device 1026crosses a geofence corresponding to a resource, and/or when a userdevice 1026 receives input or a site-controller request indicating thataccess data is to be transmitted to a nearby site controller), userdevice 1026 may retrieve the first access code data and transmit it(e.g., via a short-range communication) to a first site controller 712a.

First site controller 712 a may communicate with primary load managementsystem 1014 to verify the data, in a manner similar to that describedherein. Upon detecting that the first access code data has beenverified, first site controller 712 a can transmit second access codedata to user device 1026. The second access code data have a precisionof association that associates the data with one or more particularaccess characteristics (e.g., one or more seats). The second access codedata may be, for example, generated at first site controller 712 a orreceived from primary load management system (e.g., as part of theverification communication or as part of another communication). Theparticular access characteristics may be identified based on, forexample, a technique described in U.S. application Ser. No. 14/063,929,filed on Oct. 25, 2013, which is hereby incorporated by reference in itsentirety for all purposes. The particular access characteristics may beidentified based on, for example, for which and/or how many access-rightresults first access code data had been previously verified and/or whichand/or how many second access codes had been generated and/ortransmitted.

The second access code data may indicate where access to a resource isauthorized, and user device 1026 may thus move to a correspondinglocation. In some instance, a second site controller 712 b is associatedwith the corresponding location. User device 1026 may then transmit thesecond access code data (e.g., when user device 1026 detects that it hascrossed a geofence corresponding to the location and/or when user device1026 receives input or a site-controller request indicating that accessdata is to be transmitted to a nearby site controller) to second sitecontroller 712 b. Second site controller 712 b can determine whether thecode is verified (e.g., valid, has not been previously used, and/orcorresponds to the user device 1026 and/or location). The determinationcan include (for example) transmitting the second access code data toanother device (e.g., primary load management system 1014, a localserver, or another site controller, such as first site controller 712 a)and receiving second verification data that indicates whether the secondaccess code data is verified. The determination can, alternatively oradditionally, include a local determination, which may be based (forexample) on comparing the second access code data to data in a localaccess-code data store to determine whether there is a match and/orwhether the second access code data (or corresponding access code datathat is associated with same one or more particular characteristics) hasbeen previously verified. The local access-code data store may bepopulated by second site controller 712 b, for example, in response tocommunications from one or more other site controllers and/or primaryload management system 1014 that identify second access code data thathave been issued.

FIG. 11 illustrates a flowchart of an embodiment of a process 1100 forprocessing multiple queue tasks based upon task factors and resourcestructures. Process 1100 can be performed by an access managementsystem, such as access management system 120. Process 1100 begins atblock 1205 where one or more data stores are accessed. The data store(s)can include a plurality of bits. Each bit of the plurality of bitscorresponds to a data element and may include (for example) a singlevalue or string (e.g., with each of one or more components representinga particular characteristic or feature), a set of values or strings, afile, a set of files, a row or column in a table or array, and so on.Each bit of the plurality of bits corresponds to an access right (e.g.,associated with a single resource or multiple resources). In someinstances, the plurality of bits includes a bit for each access rightassociated with a resource. In some instances, the plurality of bitscorresponds to an incomplete subset of all access rights associated witha resource (e.g., those not having been assigned).

Each bit of at least some or of all of the plurality of bits can beassociated with one or more flags. Each flag may represent (for example)a characteristic of an access right corresponding to the bit. Forexample, a flag may correspond to a location, status, accessibility,value (or value group), and/or distance to a resource. In someinstances, one or more flags are deterministically associated with agiven access right (e.g., one conveying location). In some instances,one or more flags are determined or predicted based on a resource orother circumstance (e.g., past assignments for a resource). Each flagmay be of a given type, and each type may be associated with differentflags. For example, for a type of flag representing a status, differentflags may indicate that an access right represented by a bit isassigned, in an inquiry state, or is unassigned. A flag may beassociated with a bit in accordance with a schema (e.g., generallydefined, defined by a performing entity, defined for a given resource ordefined based on machine learning of flags that correspond toconstraints in request communications). The schema may indicate, forexample, that a flag is to be represented by or via (for example) avalue, data component and/or position. For example, a digit or n-bitword at a particular location may indicate a value for a type of flag.As another example, a variable's existence within a data structure or avalue of a variable may indicate a value for a type of flag.

At block 1110, a request communication is received that indicates aplurality of constraints; The request communication may be received overa network from a requestor device (e.g., user device or device operatedby a user). The request communication may have been one received (forexample) via a webpage or app page. The request communication mayidentify a resource or otherwise be associated with a resource (e.g.,via an identification of a webpage over which the communication wasreceived). The request communication may identify each of the pluralityof constraints or include other data that is associated with each ofone, more or all of the constraints. For example, the requestcommunication may include an identifier of or may have been receivedfrom a particular user, and stored data may indicate that the user has apreference, requirement or assignment history associated with aparticular constraint. It will be appreciated that requestcommunications received from different user devices and/or at differenttimes may be associated with different numbers and/or different types ofconstraints.

At block 1115, a queue task for the request communication is added to aqueue. The queue includes one that is associated with a same resource asassociated with the request communication. The queue task may identifythe plurality of constraints. The queue task may also identify anidentifier of the request communication, user associated with therequest communication and/or user device associated with the requestcommunication.

The queue task can be added to the queue in accordance with a queueplan. For example, a queue task may be added to an end of the queue orto a position determined based on(for example) when the requestcommunication was received (e.g., prioritizing tasks associated witholder request communications) and/or constraints indicated in queuetasks (e.g., prioritizing tasks associated with particular flag types orflags or prioritizing tasks with fewer constraints).

The queue can be processed by processing individual queue tasks. Upon aninitiation or completion of processing of a queue task, the task may beremoved from the queue and/or other queue tasks may be advanced in theirposition. At a point in time, it may then be determined, based on aqueue-processing protocol, that the queue task is to be processed. Forexample, the queue task may be at a lowest position and/or highestpriority.

At block 1120, a set of queue-task partitions is generated for the queuetask. Each queue-task partition of the set of queue-task partitions cancorrespond to a constraint of the plurality of constraints. In someinstances, a queue-task partition is generated for each constraint (oreach constraint type) associated with the queue task. In some instances,a queue-task partition is not generated for at least one constraint (orconstraint type) associated with the queue task (e.g., such that aqueue-task partition is not generated for a constraint when it does notcorrespond to a flag or flag type in a data structure).

At block 1130, the set of queue-task partitions is iteratively processedin accordance with a query execution plan. The iterative processing caninclude (for example) identifying an access-right result identifying oneor more bits that are associated with a flag corresponding to a firstqueue-task partition and determining whether the one or more bits areassociated with one or more other flags corresponding to each otherqueue-task partition. If the one or more bits are determined to notsatisfy a constraint of the plurality of constraints (e.g., via notbeing associated with a corresponding flag), a new access-right result(e.g., associated with a first constraint) is identified and evaluatedfor one or more other constraints of the request communication (e.g.,until it is determined that the result does not satisfy a givenconstraint or until all constraints are satisfied).

When the one or more bits meet each of the plurality of constraints(e.g., as indicated by being associated with corresponding flags), theaccess-right result can be identified as being responsive to the requestcommunication at block 1110. In various instances, a single access-rightresult (e.g., an access-right result which was the first resultidentified to satisfy each constraint) is identified in a response,multiple access-right results (e.g., a defined number of results) areidentified in a response, or each criteria-matching access-right resultis identified in a response. In some instances, an access-right resultincludes a null result, indicating that no combination of bits wasidentified for which each constraint was satisfied.

At block 1135, information about the access-right result is transmittedto the requestor device. The information may include one or morecharacteristics (e.g., and/or flag identifications) of the one or morebits associated with the result, such as a location, value and/oraccessibility; The information may be transmitted in a format to (forexample) facilitate a presentation (e.g., via a webpage or app page) atthe requestor device of text and/or a graphical representation (e.g.,location identification within a map) of the information. Thepresentation may include an interactive presentation that accepts inputfrom a user that corresponds to a request for assignment of the accessright(s) of a given (e.g., presented and/or selected) access-rightresult

At block 1140, for each access right identified in the access-rightresult, the bit corresponding to the access right is updated. The updatemay be of a type to inhibit identifying the access right in anotheraccess-right result transmitted to another requestor device. The updatemay include changing a status or flag of each bit (e.g., to be in aninquiry state or assigned state).

In one instance, the update occurs at a time corresponding to theaccess-right result identification and/or information transmission. Theupdate may then indicate that the access right(s) associated with theresult are being held or are in an inquiry state. The update may beconfigured to release the one or more bits from this state up ondetermining that (for example) a defined period of time has passed sincethe information was transmitted and no assignment has been requestedand/or that a user or requestor has closed a communication channel(e.g., webpage or browser) via which the information was transmitted.

In one instance, the update occurs in response to detecting that a useror requestor has requested that the one or more access rights beassigned to the requestor (e.g., and provided any required information)and/or in response to detecting that the one or more access rights wereassigned to the requestor. The update may then indicate that the accessright(s) associated with the result are in an assigned state or mayremove the bit(s) corresponding to the access right(s) from the one ormore data stores.

FIG. 12 illustrates a flowchart of an embodiment of a process 1200 foriteratively processing the set of queue-task partitions in accordancewith a query execution plan. For example, some or all of process 1200may be performed as part or all of the iterative processing performed atblock 1125 in process 1100. Process 1200 can be performed by an accessmanagement system, such as access management system 120.

Process 1200 begins at block 1205 where an order is generated for theset of queue-task partitions. The order may indicate when each partitionis to be processed relative to other partitions. For example, in someinstances, only a single partition for a given queue task is processedat a given time, and which partition is processed can be determinedbased on the order.

In some instances, an order is generated based on a quantity of bitscorresponding to a constraint of a partition. For example, a number ofbits associated with a flag that corresponds to a constraint can beidentified for each partition. A partition associated with a smallernumber of bits can be assigned a lower order (e.g., indicating a quickerprocessing time and/or higher priority) than a partition associated witha larger number of bits. In one instance, partitions can be rankedentirely in accordance with this type of scheme (such that partitionsare ranked so as to have orders that monotonically increase inaccordance with the quantity of bits. In some instances, a constraint isdefined so as to be satisfied via any of multiple flags, and the numberof bits corresponding to the constraint may then include a total number(e.g., identified so as to avoid repeated counting of a given bit) ofbits with any of the multiple flags.

For each of one, more or all flags (e.g., represented in the one or moredata stores, defined and/or potentially represented in the one or moredata stores), a quantity of bits (or quantity of groups of bits when aflag is associated with a bit group) associated with the flag can becontinuously or repeatedly tracked. For example, a register may include,for each of the one, more or all flags, the quantity bits (or groups ofbits). The quantity may be updated upon (for example) detecting a newbit (e.g., corresponding to a resource, such as one representing anaccess right recently provisioned or recently made available), a changeto a bit (e.g., and/or associated flag), and/or an elimination of a bit(e.g., occurring in response to an assignment of the bit). The quantitymay be updated by re-evaluating the one or more data stores to identifythe quantity absolutely (e.g., via a count or search protocol) or bytracking changes involving one or more bits.

In some instances, the order can alternatively or additionally depend onone or more other factors. The one or more other factors may include(for example) one or more preferences submitted via a requestor. Forexample, a request communication may identify a priority of eachconstraint and/or which constraint(s) are essential. The one or moreother factors may be based on previous assignment and/or request data.For example, a constraint that is associated with a high requestprevalence and/or assignment completion may be associated with a higher(or, in other instances, lower) order.

At block 1210, a first queue-task partition is identified from amongstthe set of queue-task partitions based on the order. The firstqueue-task partition may be one associated with a lowest order. Thefirst queue-task partition may be associated with a fewest number ofcorresponding bits (or groups of bits).

At block 1215, a first flag associated with the first queue-taskpartition is identified. For example, the first queue-task partition maycorrespond to a given constraint. A flag may also be associated with theconstraint, and thus the first flag may be identified as beingassociated with the first queue-task partition. As another example, theconstraint may be associated with a flag, and the queue-task partitioncan be associated with the flag.

At block 1220, the one or more data stores are queried using the firstflag to identify a first access-right result that identifies one or moreaccess rights for the resource. In one instance, the entire one or moredata stores are searched to identify access right(s) associated with thefirst flag. In one instance, an index associates the first flag with anidentifier of each corresponding access rights, and block 1220 includesquerying the index.

It will be appreciated that, in some instances, the one or more datastores includes multiple potential access-right results associated withthe first flag. When a limited number of results are to be furtherevaluated in view of any remaining constraints and/or returnedresponsive to the request communication, a subset of the potentialresults (e.g., a single result) may be identified in accordance with aprotocol. The protocol may include, for example, selecting one (or more)results using a pseudo-random technique. The protocol may include, forexample, selecting one (or more) results based on a score associatedwith each of the multiple potential results. For example, a protocol maybe defined to select a single (or defined number) of potential resultsassociated with a high (e.g., highest or above-threshold) score. Thescore may be defined to be (for example) higher for access rights thatwere previously assigned quicker than other access rights for one ormore other, similar resources and/or that are associated with a locationthat is closer to a resource center.

To illustrate, a request communication may indicate that a request isfor four adjacent access rights associated with any one of threelocation areas. Thus, the request can have a first constraintcorresponding to an access-right quantity and a second constraintcorresponding to a location. Each constraint can be associated with oneor more flags. The first constraint can be associated with a set offlags reflecting that the bit is part of an adjacent group of bits(e.g., of an unassigned status) with a group length of quantity, such asa flag associated with “4”, “5” and “6+”. The second constraint can beassociated with three location flags, with each flag of the three flagscorresponding to one of the location areas. It may be determined thatfewer bits have a constraint-corresponding quantity flag than aconstraint-corresponding location flag, so a queue-task partitionassociated with the quantity constraint may be processed first to selecta set of bits corresponding to four adjacent access-rights. For example,each group of bits for which the quantity constraint is satisfied, andone group may be selected using a selection protocol.

At block 1225, a next queue-task partition is identified based on theorder. For example, a partition associated with an order of “2” may beidentified. The next queue-task partition can be associated with secondconstraint.

At block 1230, a next flag (e.g., a second flag) associated with thenext queue-task partition is identified via the constraint correspondingto the next queue-task partition. Block 1230 can parallel 1215 (butpertaining to a different partition).

At block 1235, it is determined whether the access-right resultcorrespond to the next (e.g., second) flag. For example, each of one,more or all bits associated with the result may be evaluated todetermine whether it is associated with the next flag. To illustrate, avalue at a particular position within the bit may be extracted andcompared to a value representing the next flag. As another example, anindex may be queried using the second flag to identify bits associatedwith the next flag, and it can be determined whether each of the one,more or all bits are identified.

When it is determined that the result does not correspond to the nextflag, process 1200 returns to block 1220 where another access-rightresult associated with the first flag is identified. The query may beperformed in a similar manner to a first iteration of the query but soas to prevent returning the same result. For example, a modified dataset including the plurality of bits may be generated, but bitsassociated with each previous access-right result for which it wasdetermined that the result did not correspond may be omitted from thedata set or represented in a manner to preclude subsequentidentification (e.g., by changing a status flag or first flag value). Asanother example, if an access-right result had been selected fromamongst multiple potential access-right results using a deterministicprotocol (e.g., score-based selection), a different access-right resultmay be identified by selecting an nth-ranked potential result (where ncorresponds to an iteration number of block 1220).

When it is determined that the result does correspond to the next flag,process 1200 proceeds to block 1240, where it is determined whether anymore queue-task partitions remain in the set of queue-taskpartitions.(e.g., beyond the first queue-task partition and eachpartition for which it had been determined that a result being currentlyevaluated corresponds to a partition-associated flag). When one or moreadditional queue-task partitions remain in the set, process 1200 returnsto block 1225 to evaluate the next partition.

When no additional partitions remain in the set, process 1200 proceedsto block 1245 where the access-right result is finalized. Thefinalization may correspond to triggering (for example) a transmissionresponsive to a request communication that identifies the access-rightresult and/or changing a status of each bit associated with the result(e.g., to be in an inquiry state). It will be appreciated that, in someinstances, a status of each bit associated with the result uponidentifying the result at block 1220. Thus, the result finalized atblock 1245 can satisfy each constraint of a request communication.

It will be appreciated that, in some instances, a result that accordswith each constraint is not present in the one or more data stores. Forexample, an iteration of block 1220 may result in a determination thatthere is not an initial or other access-right result represented in theone or more data stores that is associated with the first flag. In someinstances, a null result can then be finalized and identified in aresponse communication. In some instances, a constraint may then berelaxed. Which constraint is relaxed may depend on (for example) a rule(e.g., that identifies one or more constraints that cannot be relaxedand/or a priority indicating which constraints to relax), machinelearning (e.g., that indicates which types of constraint relaxationscontinue to result in a user completing an assignment process), user (oraccount) preferences, and/or how many bits are associated with a flagcorresponding to each constraint in a request (e.g., so as topreferentially relax a constraint that is most restricting access-rightoptions).

FIG. 13 illustrates an example of generating and processing queue tasksvia queue-task partitioning. A plurality of user devices 1305 a-1305 dcommunicate with a queue engine 1310. Specifically, each user devicetransmits a request communication for access to a resource. The requestcommunication and/or other information may include one or moreconstraints on the request. The other information may include (forexample) data associated with and/or presented at a webpage or app pagevia which the request communication was received.

Queue engine 1310 manages, in the depicted instance, a queue 1315 thatcorresponds (e.g., exclusively or non-exclusively) to a resource.

Queue engine 1310 parses and/or otherwise assesses a requestcommunication to determine that it corresponds to the resource and toidentify any constraints associated with the request communication.Queue engine 1310 then generates a queue task 1320 for the requestcommunication that includes or is other associated with each constraint1325. The queue task may include or otherwise be associated with anidentifier of a corresponding user device.

Queue engine 1310 can generate and/or control a schedule and/or priorityfor queue tasks. In one instance, queue tasks are appended to an end ofa corresponding queue as they are generated, and queue tasks areprocessed in an order corresponding to positions within the queue.

A task partitioner 1330 evaluates each task to determine whether it isassociated with multiple constraints 1325. Upon detecting multipleconstraints, task partitioner 1330 generates a queue-task partition 1335for each constraint. In some instances, each partition identifies aconstraint. In some instances, each partition identifies one or moreflags associated with a constraint.

Task partitioner 1330 can also order the queue-task partitions. Theorder can represent when each partition is to be processed relative toeach other. In one instance, the order depends on a quantity of bitsassociated with each of various flags (or combinations of flags)associated with the constraints of the partition.

For example, a resource structure 1345 may include a set of bits. Eachbit in the set of bits can correspond to an access right. Resourcestructure 1345 may also indicate that, for each of at least some of theset of bits, one or more particular flags are associated with the bit. Abit structure engine 1350 may track which bits are included in resourcestructure 1345 (e.g., and are associated with a particular resourceand/or unassigned status). Bit structure engine 1350 may further trackhow many of the bits are associated with each of various flags. Theseflag-associated quantities can be stored in an index 1355. Taskpartitioner 1330 can then retrieve data from index 1355 to determine,for each partition, how many bits are associated with one or more flagsassociated with a constraint of the partition. Task partitioner 1330 mayassign a lower (e.g., more highly prioritized) order to partitionsassociated with a lower flag quantity.

A partition processor 1340 can then begin sequentially processing eachqueue-task partition. The sequential processing may include processing afirst partition (e.g., lowest order partition) so as to identify one ormore access-right results (e.g., each result being associated with oneor more bits) that correspond to a constraint associated with thepartition. Processing each of one, more or all other partitions caninclude assessing he one or more access-right results to (for example)determine whether the result(s) correspond with a constraint (or eachconstraint) associated with the other partition. If it is determinedthat a result does not correspond to a constraint (e.g., which, whenmultiple results are identified for a first partition, may includedetermining that each of the results, one of the results or at least adefined threshold of results do not correspond to a constraint),partition processor 1340 may return to a first or lowest-orderqueue-task partition.

Upon completion of a queue-task processing, partition processor 1340 canoutput an access-right result 1350. The access-right result may includea result identified as satisfying each constraint of a queue task. Insome instances, an access-right result includes a null result,indicating that a result corresponding to each request-associatedconstraint was not identified.

An access-right results may identify one or more access rights and/orone or more bits (e.g., associated with one or more access rights). Inone instance, assignment engine 1355 generates a response communicationthat identifies one or more access rights and/or characteristic(s)pertaining to the one or more access rights.

In one instance, the access right(s) and/or bit(s) are identified via aresponse communication transmitted to a user device and may be assignedto the user upon receiving a subsequent request for the particularassignment (e.g., and verifying that all required data for theassignment had been provided or was accessible). A status of each bit ofthe one or more bits (or, for each of the one or more access rights, anassociated bit) may be changed to inhibit the bit from being identifiedin another access-right result and/or assigned. For example, the updatemay include changing a status to a Hold or Inquiry-State status for adefined period of time.

In one instance, the access right(s) and/or bit(s) are automaticallyassigned to a user associated with a request upon identifying the resultand/or ensuring that all required data for the assignment had beenprovided or was accessible. The assignment may include changing a statusof each bit of the one or more bits (or, for each of the one or moreaccess rights, an associated bit) to an Assigned or Unavailable status.The assignment may include associating each bit of the one or more bits(or, for each of the one or more access rights, an associated bit) withan identifier or a request, user device and/or user. The assignment mayinclude removing each bit of the one or more bits (or, for each of theone or more access rights, an associated bit) from a data store (e.g.,resource structure 1345). The assignment may include transmitting, foreach bit of the one or more bits (or, for each of the one or more accessrights, an associated bit), an access code associated with the bit to arequestor device.

Specific details are given in the above description to provide athorough understanding of the embodiments. However, it is understoodthat the embodiments can be practiced without these specific details.For example, circuits can be shown in block diagrams in order not toobscure the embodiments in unnecessary detail. In other instances,well-known circuits, processes, algorithms, structures, and techniquescan be shown without unnecessary detail in order to avoid obscuring theembodiments.

Implementation of the techniques, blocks, steps and means describedabove can be done in various ways. For example, these techniques,blocks, steps and means can be implemented in hardware, software, or acombination thereof. For a hardware implementation, the processing unitscan be implemented within one or more application specific integratedcircuits (ASICs), digital signal processors (DSPs), digital signalprocessing devices (DSPDs), programmable logic devices (PLDs), fieldprogrammable gate arrays (FPGAs), processors, controllers,micro-controllers, microprocessors, other electronic units designed toperform the functions described above, and/or a combination thereof.

Also, it is noted that the embodiments can be described as a processwhich is depicted as a flowchart, a flow diagram, a data flow diagram, astructure diagram, or a block diagram. Although a flowchart can describethe operations as a sequential process, many of the operations can beperformed in parallel or concurrently. In addition, the order of theoperations can be re-arranged. A process is terminated when itsoperations are completed, but could have additional steps not includedin the figure. A process can correspond to a method, a function, aprocedure, a subroutine, a subprogram, etc. When a process correspondsto a function, its termination corresponds to a return of the functionto the calling function or the main function.

Furthermore, embodiments can be implemented by hardware, software,scripting languages, firmware, middleware, microcode, hardwaredescription languages, and/or any combination thereof. When implementedin software, firmware, middleware, scripting language, and/or microcode,the program code or code segments to perform the necessary tasks can bestored in a machine readable medium such as a storage medium. A codesegment or machine-executable instruction can represent a procedure, afunction, a subprogram, a program, a routine, a subroutine, a module, asoftware package, a script, a class, or any combination of instructions,data structures, and/or program statements. A code segment can becoupled to another code segment or a hardware circuit by passing and/orreceiving information, data, arguments, parameters, and/or memorycontents. Information, arguments, parameters, data, etc. can be passed,forwarded, or transmitted via any suitable means including memorysharing, message passing, ticket passing, network transmission, etc.

For a firmware and/or software implementation, the methodologies can beimplemented with modules (e.g., procedures, functions, and so on) thatperform the functions described herein. Any machine-readable mediumtangibly embodying instructions can be used in implementing themethodologies described herein. For example, software codes can bestored in a memory. Memory can be implemented within the processor orexternal to the processor. As used herein the term “memory” refers toany type of long term, short term, volatile, nonvolatile, or otherstorage medium and is not to be limited to any particular type of memoryor number of memories, or type of media upon which memory is stored.

Moreover, as disclosed herein, the term “storage medium”, “storage” or“memory” can represent one or more memories for storing data, includingread only memory (ROM), random access memory (RAM), magnetic RAM, corememory, magnetic disk storage mediums, optical storage mediums, flashmemory devices and/or other machine readable mediums for storinginformation. The term “machine-readable medium” includes, but is notlimited to portable or fixed storage devices, optical storage devices,wireless channels, and/or various other storage mediums capable ofstoring that contain or carry instruction(s) and/or data.

While the principles of the disclosure have been described above inconnection with specific apparatuses and methods, it is to be clearlyunderstood that this description is made only by way of example and notas limitation on the scope of the disclosure.

1. (canceled)
 2. A digital data processing system for prioritizingqueries of queue-task partitions based on distributions of flagsassigned to bits corresponding to access rights, the digital dataprocessing system including: one or more data processors; and anon-transitory computer readable storage medium containing instructionswhich when executed on the one or more data processors, cause the one ormore data processors to perform actions including: defining a set ofbits, each bit of the set of bits being associated with an access rightto a resource, each bit of the set of bits including a data element andbeing associated with one or more flags that represent characteristicsof the associated access right, and the association of a flag with a bitbeing determined in accordance with a schema; accessing one or more datastores that store the set of bits; receiving, over a network, a requestcommunication from a requestor device, the request communicationincluding a plurality of query constraints; generating a queue task forthe request communication; adding the queue task to a queue associatedwith the resource; determining, based on a queue-processing protocol,that the queue task is to be processed; generating a set of queue-taskpartitions for the queue task, each queue-task partition of the set ofqueue-task partitions corresponding to a constraint of the plurality ofconstraints; accessing an index that identifies, for each flag, aquantity of bits associated with the flag; generating an order for theset of queue-task partitions, the order of queue-task partitions withinthe set of queue-task partitions being based on the index, such thateach queue-task partition of the set of queue-task partitions is orderedaccording to the quantity of bits associated with the queue-taskpartition; and iteratively processing each queue-task partition of theset of queue-task partitions based on the generated order.
 3. Thedigital data processing system for prioritizing queries of queue-taskpartitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 2, whereiniteratively processing each queue-task partition of the set ofqueue-task partitions based on the generated order includes: identifyinga first queue-task partition from amongst the set of queue-taskpartitions based on the order; identifying a first flag associated withthe first queue-task partition via the constraint corresponding to thefirst queue-task partition; querying the one or more data stores usingthe first flag to identify a first access-right result that identifiesone or more access rights for the resource; identifying a secondqueue-task partition from amongst the set of queue-task partitions basedon the order; identifying a second flag associated with the secondqueue-task partition via the constraint corresponding to the secondqueue-task partition; and determining whether the first access-rightresult corresponds to the second flag.
 4. The digital data processingsystem for prioritizing queries of queue-task partitions based ondistributions of flags assigned to bits corresponding to access rights,as recited in claim 3, wherein when it is determined that the firstaccess-right result does not correspond to the second flag, querying theone or more data stores using the first flag to identify a secondaccess-right result different than the first access-right result.
 5. Thedigital data processing system for prioritizing queries of queue-taskpartitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 4, wherein when itis determined that the first access-right result does correspond to thesecond flags, determining whether any unprocessed queue-task partitionsremain in the set of queue-task partitions.
 6. The digital dataprocessing system for prioritizing queries of queue-task partitionsbased on distributions of flags assigned to bits corresponding to accessrights, as recited in claim 2, further comprising: identifying anaccess-right result based on the iterative processing; transmittinginformation about the access-right result to the requestor device; andupdating, for each access right identified in the access-right result,the bit corresponding to the access right to inhibit identifying theaccess right in another access-right result transmitted to anotherrequestor device.
 7. The digital data processing system for prioritizingqueries of queue-task partitions based on distributions of flagsassigned to bits corresponding to access rights, as recited in claim 2,wherein a characteristic represented by a flag includes any of alocation of the associated access right, a status of the associatedaccess right, or a value or value group of the associated access right.8. The digital data processing system for prioritizing queries ofqueue-task partitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 2, wherein each flagof the one or more flags corresponds to a flag type, and the flag typeis associated with two or more flags.
 9. A computer-implemented methodfor prioritizing queries of queue-task partitions based on distributionsof flags assigned to bits corresponding to access rights, the methodcomprising: defining a set of bits, each bit of the set of bits beingassociated with an access right to a resource, each bit of the set ofbits including a data element and being associated with one or moreflags that represent characteristics of the associated access right, andthe association of a flag with a bit being determined in accordance witha schema; accessing one or more data stores that store the set of bits;receiving, over a network, a request communication from a requestordevice, the request communication including a plurality of queryconstraints; generating a queue task for the request communication;adding the queue task to a queue associated with the resource;determining, based on a queue-processing protocol, that the queue taskis to be processed; generating a set of queue-task partitions for thequeue task, each queue-task partition of the set of queue-taskpartitions corresponding to a constraint of the plurality ofconstraints; accessing an index that identifies, for each flag, aquantity of bits associated with the flag; generating an order for theset of queue-task partitions, the order of queue-task partitions withinthe set of queue-task partitions being based on the index, such thateach queue-task partition of the set of queue-task partitions is orderedaccording to the quantity of bits associated with the queue-taskpartition; and iteratively processing each queue-task partition of theset of queue-task partitions based on the generated order.
 10. Thecomputer-implemented method for prioritizing queries of queue-taskpartitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 9, whereiniteratively processing each queue-task partition of the set ofqueue-task partitions based on the generated order includes: identifyinga first queue-task partition from amongst the set of queue-taskpartitions based on the order; identifying a first flag associated withthe first queue-task partition via the constraint corresponding to thefirst queue-task partition; querying the one or more data stores usingthe first flag to identify a first access-right result that identifiesone or more access rights for the resource; identifying a secondqueue-task partition from amongst the set of queue-task partitions basedon the order; identifying a second flag associated with the secondqueue-task partition via the constraint corresponding to the secondqueue-task partition; and determining whether the first access-rightresult corresponds to the second flag.
 11. The computer-implementedmethod for prioritizing queries of queue-task partitions based ondistributions of flags assigned to bits corresponding to access rights,as recited in claim 10, wherein when it is determined that the firstaccess-right result does not correspond to the second flag, querying theone or more data stores using the first flag to identify a secondaccess-right result different than the first access-right result. 12.The computer-implemented method for prioritizing queries of queue-taskpartitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 11, wherein when itis determined that the first access-right result does correspond to thesecond flags, determining whether any unprocessed queue-task partitionsremain in the set of queue-task partitions.
 13. The computer-implementedmethod for prioritizing queries of queue-task partitions based ondistributions of flags assigned to bits corresponding to access rights,as recited in claim 9, further comprising: identifying an access-rightresult based on the iterative processing; transmitting information aboutthe access-right result to the requestor device; and updating, for eachaccess right identified in the access-right result, the bitcorresponding to the access right to inhibit identifying the accessright in another access-right result transmitted to another requestordevice.
 14. The computer-implemented method for prioritizing queries ofqueue-task partitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 9, wherein acharacteristic represented by a flag includes any of a location of theassociated access right, a status of the associated access right, or avalue or value group of the associated access right.
 15. Thecomputer-implemented method for prioritizing queries of queue-taskpartitions based on distributions of flags assigned to bitscorresponding to access rights, as recited in claim 9, wherein each flagof the one or more flags corresponds to a flag type, and the flag typeis associated with two or more flags.
 16. A computer-program producttangibly embodied in a non-transitory machine-readable storage medium,including instructions configured to cause a data processing apparatusto perform operations including: defining a set of bits, each bit of theset of bits being associated with an access right to a resource, eachbit of the set of bits including a data element and being associatedwith one or more flags that represent characteristics of the associatedaccess right, and the association of a flag with a bit being determinedin accordance with a schema; accessing one or more data stores thatstore the set of bits; receiving, over a network, a requestcommunication from a requestor device, the request communicationincluding a plurality of query constraints; generating a queue task forthe request communication; adding the queue task to a queue associatedwith the resource; determining, based on a queue-processing protocol,that the queue task is to be processed; generating a set of queue-taskpartitions for the queue task, each queue-task partition of the set ofqueue-task partitions corresponding to a constraint of the plurality ofconstraints; accessing an index that identifies, for each flag, aquantity of bits associated with the flag; generating an order for theset of queue-task partitions, the order of queue-task partitions withinthe set of queue-task partitions being based on the index, such thateach queue-task partition of the set of queue-task partitions is orderedaccording to the quantity of bits associated with the queue-taskpartition; and iteratively processing each queue-task partition of theset of queue-task partitions based on the generated order.
 17. Thecomputer-program product, as recited in claim 16, wherein iterativelyprocessing each queue-task partition of the set of queue-task partitionsbased on the generated order includes: identifying a first queue-taskpartition from amongst the set of queue-task partitions based on theorder; identifying a first flag associated with the first queue-taskpartition via the constraint corresponding to the first queue-taskpartition; querying the one or more data stores using the first flag toidentify a first access-right result that identifies one or more accessrights for the resource; identifying a second queue-task partition fromamongst the set of queue-task partitions based on the order; identifyinga second flag associated with the second queue-task partition via theconstraint corresponding to the second queue-task partition; anddetermining whether the first access-right result corresponds to thesecond flag.
 18. The computer-program product, as recited in claim 17,wherein when it is determined that the first access-right result doesnot correspond to the second flag, querying the one or more data storesusing the first flag to identify a second access-right result differentthan the first access-right result.
 19. The computer-program product, asrecited in claim 18, wherein when it is determined that the firstaccess-right result does correspond to the second flags, determiningwhether any unprocessed queue-task partitions remain in the set ofqueue-task partitions.
 20. The computer-program product, as recited inclaim 16, further comprising: identifying an access-right result basedon the iterative processing; transmitting information about theaccess-right result to the requestor device; and updating, for eachaccess right identified in the access-right result, the bitcorresponding to the access right to inhibit identifying the accessright in another access-right result transmitted to another requestordevice.
 21. The computer-program product, as recited in claim 16,wherein a characteristic represented by a flag includes any of alocation of the associated access right, a status of the associatedaccess right, or a value or value group of the associated access right.